./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label08.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 83ba8dc0b26e7572bb3969c6f3d087c218a7cd98d221b81c07246f42fbf2250b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 17:59:58,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:59:58,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:59:58,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:59:58,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:59:58,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:59:58,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:59:58,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:59:58,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:59:58,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:59:58,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:59:58,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:59:58,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:59:58,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:59:58,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:59:58,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:59:58,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:59:58,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:59:58,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:59:58,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:59:58,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:59:58,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:59:58,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:59:58,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:59:58,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:59:58,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:59:58,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:59:58,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:59:58,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:59:58,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:59:58,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:59:58,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:59:58,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:59:58,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:59:58,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:59:58,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:59:58,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:59:58,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:59:58,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:59:58,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:59:58,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:59:58,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:59:58,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 83ba8dc0b26e7572bb3969c6f3d087c218a7cd98d221b81c07246f42fbf2250b [2024-11-19 17:59:58,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:59:58,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:59:58,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:59:58,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:59:58,938 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:59:58,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label08.c [2024-11-19 18:00:00,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:00:00,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:00:00,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label08.c [2024-11-19 18:00:00,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a055299a/27de1a572d084f938cfceeb282aed140/FLAGb8f1109b9 [2024-11-19 18:00:00,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a055299a/27de1a572d084f938cfceeb282aed140 [2024-11-19 18:00:00,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:00:00,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:00:00,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:00:00,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:00:00,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:00:00,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:00" (1/1) ... [2024-11-19 18:00:00,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c738f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:00, skipping insertion in model container [2024-11-19 18:00:00,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:00" (1/1) ... [2024-11-19 18:00:00,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:00:01,046 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/Problem10_label08.c[4672,4685] [2024-11-19 18:00:01,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:00:01,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:00:01,270 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/Problem10_label08.c[4672,4685] [2024-11-19 18:00:01,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:00:01,348 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:00:01,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01 WrapperNode [2024-11-19 18:00:01,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:00:01,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:00:01,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:00:01,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:00:01,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,489 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-19 18:00:01,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:00:01,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:00:01,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:00:01,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:00:01,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,562 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]. [2024-11-19 18:00:01,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:00:01,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:00:01,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:00:01,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:00:01,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (1/1) ... [2024-11-19 18:00:01,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:00:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:01,687 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) [2024-11-19 18:00:01,693 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 [2024-11-19 18:00:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:00:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:00:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:00:01,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:00:01,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:00:01,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:00:03,063 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-19 18:00:03,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:00:03,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:00:03,089 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:00:03,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:03 BoogieIcfgContainer [2024-11-19 18:00:03,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:00:03,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:00:03,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:00:03,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:00:03,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:00:00" (1/3) ... [2024-11-19 18:00:03,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f926457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:03, skipping insertion in model container [2024-11-19 18:00:03,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:01" (2/3) ... [2024-11-19 18:00:03,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f926457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:03, skipping insertion in model container [2024-11-19 18:00:03,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:03" (3/3) ... [2024-11-19 18:00:03,098 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label08.c [2024-11-19 18:00:03,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:00:03,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:00:03,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:00:03,194 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;@1d630304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:00:03,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:00:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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) [2024-11-19 18:00:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 18:00:03,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:03,210 INFO L215 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] [2024-11-19 18:00:03,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2102454322, now seen corresponding path program 1 times [2024-11-19 18:00:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834904926] [2024-11-19 18:00:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:03,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834904926] [2024-11-19 18:00:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834904926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562288895] [2024-11-19 18:00:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:03,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:03,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:03,661 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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) [2024-11-19 18:00:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:04,548 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-19 18:00:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2024-11-19 18:00:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:04,563 INFO L225 Difference]: With dead ends: 552 [2024-11-19 18:00:04,563 INFO L226 Difference]: Without dead ends: 282 [2024-11-19 18:00:04,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:04,571 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:04,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:00:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-19 18:00:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-19 18:00:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 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) [2024-11-19 18:00:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-19 18:00:04,621 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 40 [2024-11-19 18:00:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:04,622 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-19 18:00:04,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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) [2024-11-19 18:00:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-19 18:00:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 18:00:04,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:04,626 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-19 18:00:04,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:00:04,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:04,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -130085954, now seen corresponding path program 1 times [2024-11-19 18:00:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:04,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29552406] [2024-11-19 18:00:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29552406] [2024-11-19 18:00:05,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29552406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:00:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526763495] [2024-11-19 18:00:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:05,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:05,101 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) [2024-11-19 18:00:05,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 18:00:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:05,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:00:05,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:00:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-19 18:00:05,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:00:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526763495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:05,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:00:05,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-19 18:00:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238537717] [2024-11-19 18:00:05,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:05,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:05,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:05,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:05,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:05,361 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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) [2024-11-19 18:00:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:05,886 INFO L93 Difference]: Finished difference Result 562 states and 752 transitions. [2024-11-19 18:00:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:05,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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 106 [2024-11-19 18:00:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:05,891 INFO L225 Difference]: With dead ends: 562 [2024-11-19 18:00:05,891 INFO L226 Difference]: Without dead ends: 560 [2024-11-19 18:00:05,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:05,893 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:05,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 11 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:00:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-19 18:00:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2024-11-19 18:00:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4071428571428573) internal successors, (591), 420 states have internal predecessors, (591), 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) [2024-11-19 18:00:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2024-11-19 18:00:05,918 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 106 [2024-11-19 18:00:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:05,919 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2024-11-19 18:00:05,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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) [2024-11-19 18:00:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2024-11-19 18:00:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 18:00:05,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:05,926 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-19 18:00:05,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 18:00:06,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:06,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1546461733, now seen corresponding path program 1 times [2024-11-19 18:00:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115381096] [2024-11-19 18:00:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115381096] [2024-11-19 18:00:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115381096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:06,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264195252] [2024-11-19 18:00:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:06,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:06,442 INFO L87 Difference]: Start difference. First operand 421 states and 591 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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) [2024-11-19 18:00:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:06,884 INFO L93 Difference]: Finished difference Result 979 states and 1339 transitions. [2024-11-19 18:00:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:06,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2024-11-19 18:00:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:06,891 INFO L225 Difference]: With dead ends: 979 [2024-11-19 18:00:06,892 INFO L226 Difference]: Without dead ends: 560 [2024-11-19 18:00:06,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:06,895 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:06,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-19 18:00:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-19 18:00:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3237924865831843) internal successors, (740), 559 states have internal predecessors, (740), 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) [2024-11-19 18:00:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2024-11-19 18:00:06,923 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 109 [2024-11-19 18:00:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:06,924 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2024-11-19 18:00:06,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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) [2024-11-19 18:00:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2024-11-19 18:00:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 18:00:06,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:06,926 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-19 18:00:06,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:00:06,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:06,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 254054476, now seen corresponding path program 1 times [2024-11-19 18:00:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:06,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713967071] [2024-11-19 18:00:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713967071] [2024-11-19 18:00:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713967071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:07,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306447514] [2024-11-19 18:00:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:07,149 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) 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) [2024-11-19 18:00:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:07,669 INFO L93 Difference]: Finished difference Result 1257 states and 1758 transitions. [2024-11-19 18:00:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) 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 [2024-11-19 18:00:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:07,678 INFO L225 Difference]: With dead ends: 1257 [2024-11-19 18:00:07,678 INFO L226 Difference]: Without dead ends: 838 [2024-11-19 18:00:07,681 INFO L431 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 [2024-11-19 18:00:07,682 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:07,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 226 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:00:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-19 18:00:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-19 18:00:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3094555873925502) internal successors, (914), 698 states have internal predecessors, (914), 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) [2024-11-19 18:00:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2024-11-19 18:00:07,707 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 115 [2024-11-19 18:00:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2024-11-19 18:00:07,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) 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) [2024-11-19 18:00:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2024-11-19 18:00:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-19 18:00:07,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:07,712 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:07,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:00:07,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:07,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 93286863, now seen corresponding path program 1 times [2024-11-19 18:00:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114021272] [2024-11-19 18:00:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 18:00:07,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114021272] [2024-11-19 18:00:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114021272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:07,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609567817] [2024-11-19 18:00:07,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:07,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:07,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:07,932 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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) [2024-11-19 18:00:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:08,393 INFO L93 Difference]: Finished difference Result 1535 states and 2010 transitions. [2024-11-19 18:00:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 175 [2024-11-19 18:00:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:08,399 INFO L225 Difference]: With dead ends: 1535 [2024-11-19 18:00:08,399 INFO L226 Difference]: Without dead ends: 977 [2024-11-19 18:00:08,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:08,404 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:08,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-19 18:00:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-19 18:00:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1905737704918034) internal successors, (1162), 976 states have internal predecessors, (1162), 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) [2024-11-19 18:00:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1162 transitions. [2024-11-19 18:00:08,431 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1162 transitions. Word has length 175 [2024-11-19 18:00:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:08,431 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1162 transitions. [2024-11-19 18:00:08,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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) [2024-11-19 18:00:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1162 transitions. [2024-11-19 18:00:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 18:00:08,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:08,435 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:08,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:00:08,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:08,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1258741848, now seen corresponding path program 1 times [2024-11-19 18:00:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326968772] [2024-11-19 18:00:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326968772] [2024-11-19 18:00:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326968772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:08,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:08,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669268746] [2024-11-19 18:00:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:08,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:08,642 INFO L87 Difference]: Start difference. First operand 977 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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) [2024-11-19 18:00:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:09,162 INFO L93 Difference]: Finished difference Result 2091 states and 2557 transitions. [2024-11-19 18:00:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2024-11-19 18:00:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:09,168 INFO L225 Difference]: With dead ends: 2091 [2024-11-19 18:00:09,168 INFO L226 Difference]: Without dead ends: 1255 [2024-11-19 18:00:09,170 INFO L431 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 [2024-11-19 18:00:09,173 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:09,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 213 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:00:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-19 18:00:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-19 18:00:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 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) [2024-11-19 18:00:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2024-11-19 18:00:09,207 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 192 [2024-11-19 18:00:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:09,208 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2024-11-19 18:00:09,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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) [2024-11-19 18:00:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2024-11-19 18:00:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-19 18:00:09,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:09,213 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-19 18:00:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 18:00:09,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:09,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash 576836307, now seen corresponding path program 1 times [2024-11-19 18:00:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15869743] [2024-11-19 18:00:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15869743] [2024-11-19 18:00:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15869743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 18:00:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842956000] [2024-11-19 18:00:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 18:00:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 18:00:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:00:09,744 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 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) [2024-11-19 18:00:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:10,296 INFO L93 Difference]: Finished difference Result 2424 states and 2831 transitions. [2024-11-19 18:00:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 18:00:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 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 [2024-11-19 18:00:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:10,302 INFO L225 Difference]: With dead ends: 2424 [2024-11-19 18:00:10,302 INFO L226 Difference]: Without dead ends: 1255 [2024-11-19 18:00:10,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:00:10,305 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:10,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:00:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-19 18:00:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-19 18:00:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.161084529505582) internal successors, (1456), 1254 states have internal predecessors, (1456), 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) [2024-11-19 18:00:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1456 transitions. [2024-11-19 18:00:10,331 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1456 transitions. Word has length 247 [2024-11-19 18:00:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:10,331 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1456 transitions. [2024-11-19 18:00:10,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 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) [2024-11-19 18:00:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1456 transitions. [2024-11-19 18:00:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-19 18:00:10,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:10,336 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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] [2024-11-19 18:00:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:00:10,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1922462329, now seen corresponding path program 1 times [2024-11-19 18:00:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:10,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123532509] [2024-11-19 18:00:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:10,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-19 18:00:10,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:10,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123532509] [2024-11-19 18:00:10,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123532509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:10,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348271642] [2024-11-19 18:00:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:10,543 INFO L87 Difference]: Start difference. First operand 1255 states and 1456 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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) [2024-11-19 18:00:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:11,008 INFO L93 Difference]: Finished difference Result 1813 states and 2098 transitions. [2024-11-19 18:00:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 283 [2024-11-19 18:00:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:11,014 INFO L225 Difference]: With dead ends: 1813 [2024-11-19 18:00:11,015 INFO L226 Difference]: Without dead ends: 1811 [2024-11-19 18:00:11,016 INFO L431 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 [2024-11-19 18:00:11,016 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:11,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 11 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-19 18:00:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1255. [2024-11-19 18:00:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.161084529505582) internal successors, (1456), 1254 states have internal predecessors, (1456), 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) [2024-11-19 18:00:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1456 transitions. [2024-11-19 18:00:11,044 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1456 transitions. Word has length 283 [2024-11-19 18:00:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:11,045 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1456 transitions. [2024-11-19 18:00:11,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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) [2024-11-19 18:00:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1456 transitions. [2024-11-19 18:00:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-19 18:00:11,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:11,050 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:11,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:00:11,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:11,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1345034793, now seen corresponding path program 1 times [2024-11-19 18:00:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743806726] [2024-11-19 18:00:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-19 18:00:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743806726] [2024-11-19 18:00:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743806726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543828682] [2024-11-19 18:00:11,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:11,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:11,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:11,247 INFO L87 Difference]: Start difference. First operand 1255 states and 1456 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2024-11-19 18:00:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:11,724 INFO L93 Difference]: Finished difference Result 1396 states and 1605 transitions. [2024-11-19 18:00:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 318 [2024-11-19 18:00:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:11,730 INFO L225 Difference]: With dead ends: 1396 [2024-11-19 18:00:11,730 INFO L226 Difference]: Without dead ends: 1394 [2024-11-19 18:00:11,730 INFO L431 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 [2024-11-19 18:00:11,733 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:11,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-19 18:00:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1116. [2024-11-19 18:00:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 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) [2024-11-19 18:00:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-19 18:00:11,755 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 318 [2024-11-19 18:00:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:11,756 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-19 18:00:11,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2024-11-19 18:00:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-19 18:00:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-19 18:00:11,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:11,762 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:11,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:00:11,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:11,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1863423575, now seen corresponding path program 1 times [2024-11-19 18:00:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318212091] [2024-11-19 18:00:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-19 18:00:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318212091] [2024-11-19 18:00:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318212091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:12,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:12,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915716876] [2024-11-19 18:00:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:12,017 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2024-11-19 18:00:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:12,486 INFO L93 Difference]: Finished difference Result 2369 states and 2844 transitions. [2024-11-19 18:00:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 339 [2024-11-19 18:00:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:12,492 INFO L225 Difference]: With dead ends: 2369 [2024-11-19 18:00:12,492 INFO L226 Difference]: Without dead ends: 1394 [2024-11-19 18:00:12,494 INFO L431 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 [2024-11-19 18:00:12,494 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:12,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 215 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-19 18:00:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-19 18:00:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.164274322169059) internal successors, (1460), 1254 states have internal predecessors, (1460), 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) [2024-11-19 18:00:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1460 transitions. [2024-11-19 18:00:12,522 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1460 transitions. Word has length 339 [2024-11-19 18:00:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:12,522 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1460 transitions. [2024-11-19 18:00:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2024-11-19 18:00:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1460 transitions. [2024-11-19 18:00:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-19 18:00:12,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:12,528 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:12,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 18:00:12,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:12,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1058902866, now seen corresponding path program 1 times [2024-11-19 18:00:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:12,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872316212] [2024-11-19 18:00:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 313 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872316212] [2024-11-19 18:00:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872316212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:00:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880211313] [2024-11-19 18:00:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:12,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:12,983 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) [2024-11-19 18:00:12,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 18:00:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:13,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:00:13,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:00:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 18:00:13,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:00:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880211313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:13,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:00:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-19 18:00:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492839082] [2024-11-19 18:00:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:13,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:13,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:00:13,345 INFO L87 Difference]: Start difference. First operand 1255 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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) [2024-11-19 18:00:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:13,864 INFO L93 Difference]: Finished difference Result 3203 states and 3742 transitions. [2024-11-19 18:00:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 340 [2024-11-19 18:00:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:13,875 INFO L225 Difference]: With dead ends: 3203 [2024-11-19 18:00:13,875 INFO L226 Difference]: Without dead ends: 2089 [2024-11-19 18:00:13,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:00:13,878 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:13,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:00:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-19 18:00:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2024-11-19 18:00:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1345785440613028) internal successors, (2369), 2088 states have internal predecessors, (2369), 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) [2024-11-19 18:00:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2369 transitions. [2024-11-19 18:00:13,945 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2369 transitions. Word has length 340 [2024-11-19 18:00:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:13,946 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2369 transitions. [2024-11-19 18:00:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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) [2024-11-19 18:00:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2369 transitions. [2024-11-19 18:00:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-19 18:00:13,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:13,956 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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] [2024-11-19 18:00:13,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 18:00:14,156 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 [2024-11-19 18:00:14,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:14,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash 539129582, now seen corresponding path program 1 times [2024-11-19 18:00:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437097802] [2024-11-19 18:00:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-19 18:00:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:14,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437097802] [2024-11-19 18:00:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437097802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682235079] [2024-11-19 18:00:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:14,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:14,449 INFO L87 Difference]: Start difference. First operand 2089 states and 2369 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) [2024-11-19 18:00:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:14,909 INFO L93 Difference]: Finished difference Result 4035 states and 4592 transitions. [2024-11-19 18:00:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:14,910 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 353 [2024-11-19 18:00:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:14,912 INFO L225 Difference]: With dead ends: 4035 [2024-11-19 18:00:14,912 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 18:00:14,916 INFO L431 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 [2024-11-19 18:00:14,917 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:14,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 212 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 18:00:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 18:00:14,918 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) [2024-11-19 18:00:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 18:00:14,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 353 [2024-11-19 18:00:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:14,919 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 18:00:14,919 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) [2024-11-19 18:00:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 18:00:14,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 18:00:14,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 18:00:14,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 18:00:14,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:14,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 18:00:15,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 18:00:15,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:00:15 BoogieIcfgContainer [2024-11-19 18:00:15,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 18:00:15,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 18:00:15,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 18:00:15,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 18:00:15,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:03" (3/4) ... [2024-11-19 18:00:15,259 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 18:00:15,279 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 18:00:15,280 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 18:00:15,281 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 18:00:15,281 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 18:00:15,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 18:00:15,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 18:00:15,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 18:00:15,447 INFO L158 Benchmark]: Toolchain (without parser) took 14686.58ms. Allocated memory was 176.2MB in the beginning and 373.3MB in the end (delta: 197.1MB). Free memory was 116.7MB in the beginning and 297.0MB in the end (delta: -180.4MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,447 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 176.2MB. Free memory was 136.2MB in the beginning and 136.1MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 18:00:15,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.70ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 86.6MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.03ms. Allocated memory is still 176.2MB. Free memory was 86.6MB in the beginning and 136.7MB in the end (delta: -50.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,448 INFO L158 Benchmark]: Boogie Preprocessor took 151.38ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 127.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,448 INFO L158 Benchmark]: RCFGBuilder took 1447.88ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 127.1MB in the beginning and 185.9MB in the end (delta: -58.8MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,449 INFO L158 Benchmark]: TraceAbstraction took 12162.54ms. Allocated memory was 239.1MB in the beginning and 373.3MB in the end (delta: 134.2MB). Free memory was 184.8MB in the beginning and 308.6MB in the end (delta: -123.7MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,449 INFO L158 Benchmark]: Witness Printer took 191.09ms. Allocated memory is still 373.3MB. Free memory was 308.6MB in the beginning and 297.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 18:00:15,452 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.27ms. Allocated memory is still 176.2MB. Free memory was 136.2MB in the beginning and 136.1MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.70ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 86.6MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.03ms. Allocated memory is still 176.2MB. Free memory was 86.6MB in the beginning and 136.7MB in the end (delta: -50.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 151.38ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 127.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1447.88ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 127.1MB in the beginning and 185.9MB in the end (delta: -58.8MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12162.54ms. Allocated memory was 239.1MB in the beginning and 373.3MB in the end (delta: 134.2MB). Free memory was 184.8MB in the beginning and 308.6MB in the end (delta: -123.7MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. * Witness Printer took 191.09ms. Allocated memory is still 373.3MB. Free memory was 308.6MB in the beginning and 297.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 134]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1239 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1239 mSDsluCounter, 1357 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4692 IncrementalHoareTripleChecker+Invalid, 5389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 697 mSolverCounterUnsat, 1295 mSDtfsCounter, 4692 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2089occurred in iteration=11, InterpolantAutomatonStates: 40, 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, 12 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3063 NumberOfCodeBlocks, 3063 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3049 ConstructedInterpolants, 0 QuantifiedInterpolants, 9025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2499/2581 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((7 <= a19) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-19 18:00:15,477 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