./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:07:35,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:07:35,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:07:35,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:07:35,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:07:35,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:07:35,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:07:35,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:07:35,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:07:35,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:07:35,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:07:35,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:07:35,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:07:35,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:07:35,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:07:35,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:07:35,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:07:35,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:07:35,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:35,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:07:35,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb [2025-03-16 14:07:35,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:07:35,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:07:35,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:07:35,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:07:35,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:07:35,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2025-03-16 14:07:36,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db75cc40/6c2bb0bdeafc48e8b9dcf3e2851ee08b/FLAGf2d5761fe [2025-03-16 14:07:36,790 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:07:36,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2025-03-16 14:07:36,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db75cc40/6c2bb0bdeafc48e8b9dcf3e2851ee08b/FLAGf2d5761fe [2025-03-16 14:07:37,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db75cc40/6c2bb0bdeafc48e8b9dcf3e2851ee08b [2025-03-16 14:07:37,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:07:37,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:07:37,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:37,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:07:37,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:07:37,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6205ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37, skipping insertion in model container [2025-03-16 14:07:37,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:07:37,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2025-03-16 14:07:37,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:37,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:07:37,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2025-03-16 14:07:37,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:37,533 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:07:37,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37 WrapperNode [2025-03-16 14:07:37,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:37,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:37,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:07:37,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:07:37,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,608 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-16 14:07:37,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:37,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:07:37,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:07:37,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:07:37,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:07:37,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:07:37,679 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:07:37,679 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:07:37,679 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:07:37,680 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (1/1) ... [2025-03-16 14:07:37,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:37,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:07:37,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:07:37,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:07:37,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:07:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:07:37,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:07:37,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:07:37,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:07:38,425 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 14:07:38,426 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:07:38,434 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:07:38,435 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:07:38,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:38 BoogieIcfgContainer [2025-03-16 14:07:38,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:07:38,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:07:38,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:07:38,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:07:38,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:07:37" (1/3) ... [2025-03-16 14:07:38,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43899d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:38, skipping insertion in model container [2025-03-16 14:07:38,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:37" (2/3) ... [2025-03-16 14:07:38,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43899d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:38, skipping insertion in model container [2025-03-16 14:07:38,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:38" (3/3) ... [2025-03-16 14:07:38,441 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2025-03-16 14:07:38,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:07:38,454 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label29.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:07:38,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:07:38,509 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7781640a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:07:38,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:07:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 14:07:38,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:38,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:38,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:38,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1019559529, now seen corresponding path program 1 times [2025-03-16 14:07:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424919460] [2025-03-16 14:07:38,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:38,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 14:07:38,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 14:07:38,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:38,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424919460] [2025-03-16 14:07:38,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424919460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37644148] [2025-03-16 14:07:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:38,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:07:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:38,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:07:38,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:38,836 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:38,853 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2025-03-16 14:07:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:07:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 14:07:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:38,860 INFO L225 Difference]: With dead ends: 273 [2025-03-16 14:07:38,860 INFO L226 Difference]: Without dead ends: 134 [2025-03-16 14:07:38,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:38,864 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:38,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:07:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-16 14:07:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-16 14:07:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2025-03-16 14:07:38,894 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 100 [2025-03-16 14:07:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:38,895 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2025-03-16 14:07:38,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2025-03-16 14:07:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 14:07:38,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:38,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:38,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:07:38,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:38,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash 631423896, now seen corresponding path program 1 times [2025-03-16 14:07:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454707147] [2025-03-16 14:07:38,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:38,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 14:07:38,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 14:07:38,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:38,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454707147] [2025-03-16 14:07:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454707147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:39,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617792404] [2025-03-16 14:07:39,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:39,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:39,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:39,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:39,330 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:40,006 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2025-03-16 14:07:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:40,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 14:07:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:40,010 INFO L225 Difference]: With dead ends: 529 [2025-03-16 14:07:40,010 INFO L226 Difference]: Without dead ends: 396 [2025-03-16 14:07:40,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:40,016 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 318 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:40,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 36 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:07:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-16 14:07:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-16 14:07:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2025-03-16 14:07:40,037 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 100 [2025-03-16 14:07:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2025-03-16 14:07:40,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2025-03-16 14:07:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 14:07:40,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:40,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:07:40,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1564279985, now seen corresponding path program 1 times [2025-03-16 14:07:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093936699] [2025-03-16 14:07:40,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:40,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 14:07:40,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 14:07:40,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:40,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093936699] [2025-03-16 14:07:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093936699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291490264] [2025-03-16 14:07:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:40,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:40,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:40,323 INFO L87 Difference]: Start difference. First operand 396 states and 516 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:40,860 INFO L93 Difference]: Finished difference Result 886 states and 1234 transitions. [2025-03-16 14:07:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:40,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 14:07:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:40,863 INFO L225 Difference]: With dead ends: 886 [2025-03-16 14:07:40,863 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 14:07:40,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:40,868 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:40,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 81 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:07:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 14:07:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2025-03-16 14:07:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.1974683544303797) internal successors, (473), 395 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 473 transitions. [2025-03-16 14:07:40,882 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 473 transitions. Word has length 107 [2025-03-16 14:07:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:40,886 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 473 transitions. [2025-03-16 14:07:40,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 473 transitions. [2025-03-16 14:07:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 14:07:40,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:40,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:40,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:07:40,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 836593786, now seen corresponding path program 1 times [2025-03-16 14:07:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307707704] [2025-03-16 14:07:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 14:07:40,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 14:07:40,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:40,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307707704] [2025-03-16 14:07:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307707704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:41,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383234285] [2025-03-16 14:07:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:41,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:41,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:41,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:41,034 INFO L87 Difference]: Start difference. First operand 396 states and 473 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:41,455 INFO L93 Difference]: Finished difference Result 1053 states and 1282 transitions. [2025-03-16 14:07:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 14:07:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:41,457 INFO L225 Difference]: With dead ends: 1053 [2025-03-16 14:07:41,457 INFO L226 Difference]: Without dead ends: 658 [2025-03-16 14:07:41,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:41,458 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 381 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:41,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 31 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-16 14:07:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2025-03-16 14:07:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.1933028919330289) internal successors, (784), 657 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 784 transitions. [2025-03-16 14:07:41,472 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 784 transitions. Word has length 115 [2025-03-16 14:07:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:41,472 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 784 transitions. [2025-03-16 14:07:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 784 transitions. [2025-03-16 14:07:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 14:07:41,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:41,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:07:41,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:41,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2089200098, now seen corresponding path program 1 times [2025-03-16 14:07:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325503271] [2025-03-16 14:07:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:41,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 14:07:41,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 14:07:41,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:07:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325503271] [2025-03-16 14:07:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325503271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400054340] [2025-03-16 14:07:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:41,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:41,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:41,568 INFO L87 Difference]: Start difference. First operand 658 states and 784 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:41,862 INFO L93 Difference]: Finished difference Result 1839 states and 2181 transitions. [2025-03-16 14:07:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-16 14:07:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:41,866 INFO L225 Difference]: With dead ends: 1839 [2025-03-16 14:07:41,866 INFO L226 Difference]: Without dead ends: 1182 [2025-03-16 14:07:41,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:41,869 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 131 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:41,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 27 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-16 14:07:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1051. [2025-03-16 14:07:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.2) internal successors, (1260), 1050 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1260 transitions. [2025-03-16 14:07:41,895 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1260 transitions. Word has length 124 [2025-03-16 14:07:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:41,895 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1260 transitions. [2025-03-16 14:07:41,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1260 transitions. [2025-03-16 14:07:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 14:07:41,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:41,898 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:41,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:07:41,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:41,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash -532655153, now seen corresponding path program 1 times [2025-03-16 14:07:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:41,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60383884] [2025-03-16 14:07:41,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:41,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 14:07:41,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 14:07:41,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:41,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 14:07:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60383884] [2025-03-16 14:07:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60383884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101057449] [2025-03-16 14:07:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:42,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:42,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:42,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:42,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:42,027 INFO L87 Difference]: Start difference. First operand 1051 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:42,335 INFO L93 Difference]: Finished difference Result 2363 states and 2812 transitions. [2025-03-16 14:07:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-16 14:07:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:42,339 INFO L225 Difference]: With dead ends: 2363 [2025-03-16 14:07:42,339 INFO L226 Difference]: Without dead ends: 1313 [2025-03-16 14:07:42,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:42,341 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:42,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 189 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2025-03-16 14:07:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1182. [2025-03-16 14:07:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.1600338696020323) internal successors, (1370), 1181 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1370 transitions. [2025-03-16 14:07:42,361 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1370 transitions. Word has length 130 [2025-03-16 14:07:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1370 transitions. [2025-03-16 14:07:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1370 transitions. [2025-03-16 14:07:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 14:07:42,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:42,363 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:42,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:07:42,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1655344532, now seen corresponding path program 1 times [2025-03-16 14:07:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376389412] [2025-03-16 14:07:42,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:42,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 14:07:42,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 14:07:42,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:42,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:07:42,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376389412] [2025-03-16 14:07:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376389412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:42,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184083405] [2025-03-16 14:07:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:42,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:42,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:42,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:42,532 INFO L87 Difference]: Start difference. First operand 1182 states and 1370 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:42,965 INFO L93 Difference]: Finished difference Result 2756 states and 3182 transitions. [2025-03-16 14:07:42,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-03-16 14:07:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:42,970 INFO L225 Difference]: With dead ends: 2756 [2025-03-16 14:07:42,970 INFO L226 Difference]: Without dead ends: 1575 [2025-03-16 14:07:42,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:42,972 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 344 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:42,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 43 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-03-16 14:07:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1444. [2025-03-16 14:07:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1462231462231462) internal successors, (1654), 1443 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1654 transitions. [2025-03-16 14:07:42,996 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1654 transitions. Word has length 144 [2025-03-16 14:07:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:42,997 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1654 transitions. [2025-03-16 14:07:42,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1654 transitions. [2025-03-16 14:07:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 14:07:42,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:42,999 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:43,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:07:43,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2071820497, now seen corresponding path program 1 times [2025-03-16 14:07:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568240594] [2025-03-16 14:07:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:43,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 14:07:43,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 14:07:43,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568240594] [2025-03-16 14:07:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568240594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:43,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50492336] [2025-03-16 14:07:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:43,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:43,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:43,149 INFO L87 Difference]: Start difference. First operand 1444 states and 1654 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:43,438 INFO L93 Difference]: Finished difference Result 3018 states and 3441 transitions. [2025-03-16 14:07:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-16 14:07:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:43,444 INFO L225 Difference]: With dead ends: 3018 [2025-03-16 14:07:43,444 INFO L226 Difference]: Without dead ends: 1575 [2025-03-16 14:07:43,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:43,446 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 92 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:43,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 41 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-03-16 14:07:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1444. [2025-03-16 14:07:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.142065142065142) internal successors, (1648), 1443 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1648 transitions. [2025-03-16 14:07:43,471 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1648 transitions. Word has length 177 [2025-03-16 14:07:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:43,471 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1648 transitions. [2025-03-16 14:07:43,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1648 transitions. [2025-03-16 14:07:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 14:07:43,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:43,474 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:43,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:07:43,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -847834258, now seen corresponding path program 1 times [2025-03-16 14:07:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368973405] [2025-03-16 14:07:43,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:43,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 14:07:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 14:07:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:43,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:07:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368973405] [2025-03-16 14:07:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368973405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:43,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966842802] [2025-03-16 14:07:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:43,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:43,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:43,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:43,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:43,571 INFO L87 Difference]: Start difference. First operand 1444 states and 1648 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:43,867 INFO L93 Difference]: Finished difference Result 3280 states and 3791 transitions. [2025-03-16 14:07:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:43,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2025-03-16 14:07:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:43,873 INFO L225 Difference]: With dead ends: 3280 [2025-03-16 14:07:43,873 INFO L226 Difference]: Without dead ends: 1837 [2025-03-16 14:07:43,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:43,875 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 98 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:43,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 160 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2025-03-16 14:07:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2025-03-16 14:07:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.1416122004357299) internal successors, (2096), 1836 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2096 transitions. [2025-03-16 14:07:43,907 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2096 transitions. Word has length 233 [2025-03-16 14:07:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:43,907 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2096 transitions. [2025-03-16 14:07:43,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2096 transitions. [2025-03-16 14:07:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 14:07:43,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:43,911 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:07:43,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 784875774, now seen corresponding path program 1 times [2025-03-16 14:07:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318361534] [2025-03-16 14:07:43,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:43,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:07:43,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:07:43,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 175 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318361534] [2025-03-16 14:07:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318361534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739372545] [2025-03-16 14:07:44,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:44,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:07:44,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:07:44,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:07:44,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:07:44,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:44,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:44,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-16 14:07:44,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739372545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:44,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:07:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593840648] [2025-03-16 14:07:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:44,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:44,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:44,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:44,606 INFO L87 Difference]: Start difference. First operand 1837 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:44,919 INFO L93 Difference]: Finished difference Result 4328 states and 4963 transitions. [2025-03-16 14:07:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2025-03-16 14:07:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:44,926 INFO L225 Difference]: With dead ends: 4328 [2025-03-16 14:07:44,926 INFO L226 Difference]: Without dead ends: 2492 [2025-03-16 14:07:44,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:44,927 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:44,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 17 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-16 14:07:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2361. [2025-03-16 14:07:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.1483050847457628) internal successors, (2710), 2360 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 2710 transitions. [2025-03-16 14:07:44,960 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 2710 transitions. Word has length 242 [2025-03-16 14:07:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 2710 transitions. [2025-03-16 14:07:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2710 transitions. [2025-03-16 14:07:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 14:07:44,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:44,964 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:44,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:07:45,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 14:07:45,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:45,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2130197267, now seen corresponding path program 1 times [2025-03-16 14:07:45,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:45,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410666386] [2025-03-16 14:07:45,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 14:07:45,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 14:07:45,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:45,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:45,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:45,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410666386] [2025-03-16 14:07:45,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410666386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:45,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603064820] [2025-03-16 14:07:45,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:45,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:07:45,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:07:45,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 14:07:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 14:07:45,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:45,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:45,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:45,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-16 14:07:45,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603064820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:07:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312203260] [2025-03-16 14:07:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:45,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:45,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:45,790 INFO L87 Difference]: Start difference. First operand 2361 states and 2710 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:46,109 INFO L93 Difference]: Finished difference Result 4721 states and 5419 transitions. [2025-03-16 14:07:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:46,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-03-16 14:07:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:46,114 INFO L225 Difference]: With dead ends: 4721 [2025-03-16 14:07:46,114 INFO L226 Difference]: Without dead ends: 1575 [2025-03-16 14:07:46,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:46,117 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:46,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 163 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-03-16 14:07:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1444. [2025-03-16 14:07:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.0817740817740817) internal successors, (1561), 1443 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1561 transitions. [2025-03-16 14:07:46,134 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1561 transitions. Word has length 247 [2025-03-16 14:07:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:46,135 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1561 transitions. [2025-03-16 14:07:46,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1561 transitions. [2025-03-16 14:07:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 14:07:46,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:46,137 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:46,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:07:46,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 14:07:46,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:46,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:46,343 INFO L85 PathProgramCache]: Analyzing trace with hash -75661192, now seen corresponding path program 1 times [2025-03-16 14:07:46,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:46,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934820628] [2025-03-16 14:07:46,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 14:07:46,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 14:07:46,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:46,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-16 14:07:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934820628] [2025-03-16 14:07:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934820628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:46,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571360208] [2025-03-16 14:07:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:46,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:46,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:46,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:46,483 INFO L87 Difference]: Start difference. First operand 1444 states and 1561 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:46,734 INFO L93 Difference]: Finished difference Result 3280 states and 3528 transitions. [2025-03-16 14:07:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2025-03-16 14:07:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:46,739 INFO L225 Difference]: With dead ends: 3280 [2025-03-16 14:07:46,739 INFO L226 Difference]: Without dead ends: 1837 [2025-03-16 14:07:46,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:46,741 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:46,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 27 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2025-03-16 14:07:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1444. [2025-03-16 14:07:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.0817740817740817) internal successors, (1561), 1443 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1561 transitions. [2025-03-16 14:07:46,764 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1561 transitions. Word has length 256 [2025-03-16 14:07:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:46,765 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1561 transitions. [2025-03-16 14:07:46,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1561 transitions. [2025-03-16 14:07:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 14:07:46,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:46,768 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:46,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:07:46,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:46,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -911050064, now seen corresponding path program 1 times [2025-03-16 14:07:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:46,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206452188] [2025-03-16 14:07:46,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 14:07:46,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 14:07:46,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-16 14:07:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206452188] [2025-03-16 14:07:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206452188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:46,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:46,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461594733] [2025-03-16 14:07:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:46,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:46,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:46,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:46,878 INFO L87 Difference]: Start difference. First operand 1444 states and 1561 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:47,137 INFO L93 Difference]: Finished difference Result 3149 states and 3385 transitions. [2025-03-16 14:07:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-03-16 14:07:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:47,143 INFO L225 Difference]: With dead ends: 3149 [2025-03-16 14:07:47,143 INFO L226 Difference]: Without dead ends: 1706 [2025-03-16 14:07:47,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:47,145 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:47,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 27 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-16 14:07:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1182. [2025-03-16 14:07:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.0745131244707875) internal successors, (1269), 1181 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1269 transitions. [2025-03-16 14:07:47,176 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1269 transitions. Word has length 259 [2025-03-16 14:07:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1269 transitions. [2025-03-16 14:07:47,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1269 transitions. [2025-03-16 14:07:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 14:07:47,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:47,179 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:47,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:07:47,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1381264113, now seen corresponding path program 1 times [2025-03-16 14:07:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87946011] [2025-03-16 14:07:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:47,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 14:07:47,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 14:07:47,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:47,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-16 14:07:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87946011] [2025-03-16 14:07:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87946011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:47,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:07:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56328651] [2025-03-16 14:07:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:47,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:47,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:47,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:47,501 INFO L87 Difference]: Start difference. First operand 1182 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:47,872 INFO L93 Difference]: Finished difference Result 2625 states and 2806 transitions. [2025-03-16 14:07:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-16 14:07:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:47,876 INFO L225 Difference]: With dead ends: 2625 [2025-03-16 14:07:47,876 INFO L226 Difference]: Without dead ends: 1444 [2025-03-16 14:07:47,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:47,878 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 337 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:47,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 29 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-16 14:07:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1182. [2025-03-16 14:07:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.0635055038103303) internal successors, (1256), 1181 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1256 transitions. [2025-03-16 14:07:47,892 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1256 transitions. Word has length 265 [2025-03-16 14:07:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:47,893 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1256 transitions. [2025-03-16 14:07:47,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1256 transitions. [2025-03-16 14:07:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 14:07:47,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:47,895 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:47,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:07:47,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:47,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash -187962711, now seen corresponding path program 1 times [2025-03-16 14:07:47,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:47,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328680645] [2025-03-16 14:07:47,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:47,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:07:47,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:07:47,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:47,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-16 14:07:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328680645] [2025-03-16 14:07:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328680645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869628049] [2025-03-16 14:07:48,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:48,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:48,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:07:48,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:07:48,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:07:48,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:07:48,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:48,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:48,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:48,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-16 14:07:48,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869628049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:48,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:07:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062912] [2025-03-16 14:07:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:48,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:48,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:48,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:48,317 INFO L87 Difference]: Start difference. First operand 1182 states and 1256 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:48,554 INFO L93 Difference]: Finished difference Result 2361 states and 2510 transitions. [2025-03-16 14:07:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:48,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-16 14:07:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:48,555 INFO L225 Difference]: With dead ends: 2361 [2025-03-16 14:07:48,555 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:07:48,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:48,556 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:48,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 149 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:07:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:07:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:07:48,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 271 [2025-03-16 14:07:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:48,557 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:07:48,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:07:48,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:07:48,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:07:48,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:07:48,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:48,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:48,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:07:49,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:07:49,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:07:49 BoogieIcfgContainer [2025-03-16 14:07:49,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:07:49,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:07:49,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:07:49,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:07:49,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:38" (3/4) ... [2025-03-16 14:07:49,446 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:07:49,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:07:49,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:07:49,466 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:07:49,466 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:07:49,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:07:49,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:07:49,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:07:49,567 INFO L158 Benchmark]: Toolchain (without parser) took 12446.31ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 131.7MB in the beginning and 350.4MB in the end (delta: -218.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-16 14:07:49,567 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 131.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:49,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.76ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 105.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:07:49,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.41ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 99.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:07:49,569 INFO L158 Benchmark]: Boogie Preprocessor took 69.18ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 95.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:49,569 INFO L158 Benchmark]: IcfgBuilder took 756.46ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 103.8MB in the end (delta: -8.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 14:07:49,569 INFO L158 Benchmark]: TraceAbstraction took 11007.18ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 103.0MB in the beginning and 362.8MB in the end (delta: -259.9MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. [2025-03-16 14:07:49,569 INFO L158 Benchmark]: Witness Printer took 122.21ms. Allocated memory is still 402.7MB. Free memory was 362.8MB in the beginning and 350.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:07:49,570 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 131.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.76ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 105.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.41ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 99.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.18ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 95.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 756.46ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 103.8MB in the end (delta: -8.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11007.18ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 103.0MB in the beginning and 362.8MB in the end (delta: -259.9MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. * Witness Printer took 122.21ms. Allocated memory is still 402.7MB. Free memory was 362.8MB in the beginning and 350.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 489]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 265 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2309 mSDsluCounter, 1223 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5178 IncrementalHoareTripleChecker+Invalid, 5880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 1135 mSDtfsCounter, 5178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2361occurred in iteration=10, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 2096 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3530 NumberOfCodeBlocks, 3530 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3512 ConstructedInterpolants, 0 QuantifiedInterpolants, 14158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1403 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 3301/3584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: (((((((((((((a7 != 1) && (a17 <= 0)) && (a20 == 1)) || (((5 == a16) && (a17 <= 0)) && (14 <= a8))) || ((((a20 != 1) && (a7 != 1)) && (a17 == 1)) && (15 <= a8))) || (((a21 <= 0) && (a17 <= 0)) && (a20 == 1))) || (((a7 != 1) && (a17 <= 0)) && (15 <= a8))) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || ((((a20 != 1) && (a7 != 1)) && (a17 == 1)) && (a16 <= 5))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((a7 != 1) && (a17 <= 0)) && (a16 <= 5))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((((a20 != 1) && (a17 <= 0)) && (14 <= a8)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:07:49,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE