./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/Problem02_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/Problem02_label14.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 471d591bac756b3641e5eebd3ed64b220338148881b3c7fbab3f4295451226cd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:44:19,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:44:19,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:44:19,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:44:19,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:44:19,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:44:19,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:44:19,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:44:19,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:44:19,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:44:19,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:44:19,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:44:19,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:44:19,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:44:19,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:44:19,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:44:19,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:44:19,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:44:19,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:44:19,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:44:19,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:44:19,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:44:19,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:44:19,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:44:19,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:44:19,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:44:19,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:44:19,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:44:19,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:44:19,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:44:19,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:44:19,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:44:19,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:44:19,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:44:19,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:44:19,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:44:19,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:44:19,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:44:19,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:44:19,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:44:19,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:44:19,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:44:19,118 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 -> 471d591bac756b3641e5eebd3ed64b220338148881b3c7fbab3f4295451226cd [2024-10-13 22:44:19,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:44:19,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:44:19,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:44:19,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:44:19,365 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:44:19,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2024-10-13 22:44:20,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:44:20,840 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:44:20,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2024-10-13 22:44:20,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc7cd48c/84a435fe647f4f34a99539cb4f823aff/FLAGbfe6d63c1 [2024-10-13 22:44:21,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc7cd48c/84a435fe647f4f34a99539cb4f823aff [2024-10-13 22:44:21,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:44:21,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:44:21,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:44:21,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:44:21,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:44:21,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578ce71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21, skipping insertion in model container [2024-10-13 22:44:21,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:44:21,713 WARN L248 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/Problem02_label14.c[18715,18728] [2024-10-13 22:44:21,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:44:21,771 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:44:21,877 WARN L248 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/Problem02_label14.c[18715,18728] [2024-10-13 22:44:21,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:44:21,900 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:44:21,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21 WrapperNode [2024-10-13 22:44:21,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:44:21,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:44:21,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:44:21,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:44:21,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,953 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-13 22:44:21,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:44:21,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:44:21,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:44:21,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:44:21,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,983 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-10-13 22:44:21,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:21,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:22,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:22,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:22,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:44:22,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:44:22,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:44:22,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:44:22,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (1/1) ... [2024-10-13 22:44:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:44:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:44:22,046 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-10-13 22:44:22,053 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-10-13 22:44:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:44:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:44:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:44:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:44:22,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:44:22,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:44:23,306 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-13 22:44:23,306 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:44:23,435 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:44:23,435 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:44:23,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:44:23 BoogieIcfgContainer [2024-10-13 22:44:23,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:44:23,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:44:23,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:44:23,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:44:23,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:44:21" (1/3) ... [2024-10-13 22:44:23,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10861ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:44:23, skipping insertion in model container [2024-10-13 22:44:23,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:21" (2/3) ... [2024-10-13 22:44:23,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10861ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:44:23, skipping insertion in model container [2024-10-13 22:44:23,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:44:23" (3/3) ... [2024-10-13 22:44:23,443 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2024-10-13 22:44:23,468 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:44:23,468 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:44:23,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:44:23,526 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;@4c440bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:44:23,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:44:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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-10-13 22:44:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 22:44:23,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:23,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 22:44:23,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:23,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -127666661, now seen corresponding path program 1 times [2024-10-13 22:44:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:23,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010930520] [2024-10-13 22:44:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:23,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010930520] [2024-10-13 22:44:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010930520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:23,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:44:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950171271] [2024-10-13 22:44:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:23,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:44:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:44:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:44:23,894 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 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-10-13 22:44:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:23,922 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-13 22:44:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:44:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2024-10-13 22:44:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:23,932 INFO L225 Difference]: With dead ends: 329 [2024-10-13 22:44:23,932 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 22:44:23,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:44:23,937 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:23,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:44:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 22:44:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-13 22:44:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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-10-13 22:44:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-13 22:44:23,968 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 116 [2024-10-13 22:44:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:23,969 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-13 22:44:23,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 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-10-13 22:44:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-13 22:44:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 22:44:23,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:23,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 22:44:23,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:44:23,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:23,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:23,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2131194526, now seen corresponding path program 1 times [2024-10-13 22:44:23,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:23,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736825398] [2024-10-13 22:44:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736825398] [2024-10-13 22:44:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736825398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:44:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910350861] [2024-10-13 22:44:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:24,124 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-10-13 22:44:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:24,813 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2024-10-13 22:44:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2024-10-13 22:44:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:24,819 INFO L225 Difference]: With dead ends: 470 [2024-10-13 22:44:24,819 INFO L226 Difference]: Without dead ends: 308 [2024-10-13 22:44:24,820 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-10-13 22:44:24,821 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:24,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 116 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 22:44:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-13 22:44:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-10-13 22:44:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 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-10-13 22:44:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2024-10-13 22:44:24,843 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 116 [2024-10-13 22:44:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:24,843 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2024-10-13 22:44:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-10-13 22:44:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2024-10-13 22:44:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 22:44:24,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:24,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:24,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:44:24,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:24,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1923496265, now seen corresponding path program 1 times [2024-10-13 22:44:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:24,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156867969] [2024-10-13 22:44:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:25,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156867969] [2024-10-13 22:44:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156867969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:25,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:25,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:44:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499727510] [2024-10-13 22:44:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:25,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:25,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:25,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:25,060 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10-13 22:44:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:25,426 INFO L93 Difference]: Finished difference Result 757 states and 1033 transitions. [2024-10-13 22:44:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-10-13 22:44:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:25,428 INFO L225 Difference]: With dead ends: 757 [2024-10-13 22:44:25,429 INFO L226 Difference]: Without dead ends: 452 [2024-10-13 22:44:25,430 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-10-13 22:44:25,430 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:25,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 245 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:44:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-13 22:44:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-10-13 22:44:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.2793791574279378) internal successors, (577), 451 states have internal predecessors, (577), 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-10-13 22:44:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 577 transitions. [2024-10-13 22:44:25,449 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 577 transitions. Word has length 121 [2024-10-13 22:44:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 577 transitions. [2024-10-13 22:44:25,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10-13 22:44:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 577 transitions. [2024-10-13 22:44:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 22:44:25,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:25,451 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 22:44:25,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:44:25,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:25,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1969782308, now seen corresponding path program 1 times [2024-10-13 22:44:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:25,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122979527] [2024-10-13 22:44:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122979527] [2024-10-13 22:44:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122979527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:25,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:44:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374527425] [2024-10-13 22:44:25,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:25,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:25,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:25,524 INFO L87 Difference]: Start difference. First operand 452 states and 577 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-10-13 22:44:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:25,858 INFO L93 Difference]: Finished difference Result 1324 states and 1690 transitions. [2024-10-13 22:44:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 133 [2024-10-13 22:44:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:25,861 INFO L225 Difference]: With dead ends: 1324 [2024-10-13 22:44:25,861 INFO L226 Difference]: Without dead ends: 873 [2024-10-13 22:44:25,862 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-10-13 22:44:25,863 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:25,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 79 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:44:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-13 22:44:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-10-13 22:44:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.2293577981651376) internal successors, (1072), 872 states have internal predecessors, (1072), 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-10-13 22:44:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1072 transitions. [2024-10-13 22:44:25,886 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1072 transitions. Word has length 133 [2024-10-13 22:44:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:25,886 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1072 transitions. [2024-10-13 22:44:25,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-10-13 22:44:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1072 transitions. [2024-10-13 22:44:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 22:44:25,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:25,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:44:25,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -612256337, now seen corresponding path program 1 times [2024-10-13 22:44:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003578662] [2024-10-13 22:44:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:44:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003578662] [2024-10-13 22:44:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003578662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:26,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:26,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:44:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253030030] [2024-10-13 22:44:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:26,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:26,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:26,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:26,018 INFO L87 Difference]: Start difference. First operand 873 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10-13 22:44:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:26,510 INFO L93 Difference]: Finished difference Result 2027 states and 2467 transitions. [2024-10-13 22:44:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:26,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 162 [2024-10-13 22:44:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:26,513 INFO L225 Difference]: With dead ends: 2027 [2024-10-13 22:44:26,513 INFO L226 Difference]: Without dead ends: 1013 [2024-10-13 22:44:26,514 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-10-13 22:44:26,515 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:26,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 64 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:44:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-13 22:44:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2024-10-13 22:44:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.1425742574257425) internal successors, (1154), 1010 states have internal predecessors, (1154), 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-10-13 22:44:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1154 transitions. [2024-10-13 22:44:26,531 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1154 transitions. Word has length 162 [2024-10-13 22:44:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:26,532 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1154 transitions. [2024-10-13 22:44:26,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10-13 22:44:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1154 transitions. [2024-10-13 22:44:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 22:44:26,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:26,534 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:26,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:44:26,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:26,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:26,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1260195547, now seen corresponding path program 1 times [2024-10-13 22:44:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:26,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707893747] [2024-10-13 22:44:26,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:26,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:44:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707893747] [2024-10-13 22:44:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707893747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:26,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:44:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238914654] [2024-10-13 22:44:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:26,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:26,614 INFO L87 Difference]: Start difference. First operand 1011 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:44:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:26,914 INFO L93 Difference]: Finished difference Result 2869 states and 3281 transitions. [2024-10-13 22:44:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:26,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-10-13 22:44:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:26,920 INFO L225 Difference]: With dead ends: 2869 [2024-10-13 22:44:26,920 INFO L226 Difference]: Without dead ends: 1859 [2024-10-13 22:44:26,921 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-10-13 22:44:26,923 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 136 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:26,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 261 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:44:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-10-13 22:44:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1853. [2024-10-13 22:44:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.119330453563715) internal successors, (2073), 1852 states have internal predecessors, (2073), 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-10-13 22:44:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2073 transitions. [2024-10-13 22:44:26,971 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2073 transitions. Word has length 166 [2024-10-13 22:44:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:26,972 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2073 transitions. [2024-10-13 22:44:26,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:44:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2073 transitions. [2024-10-13 22:44:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 22:44:26,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:26,977 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:26,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:44:26,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:26,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2101768984, now seen corresponding path program 1 times [2024-10-13 22:44:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:26,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820756068] [2024-10-13 22:44:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:27,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:27,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820756068] [2024-10-13 22:44:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820756068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:27,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:44:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970761956] [2024-10-13 22:44:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:27,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:27,095 INFO L87 Difference]: Start difference. First operand 1853 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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-10-13 22:44:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:27,260 INFO L93 Difference]: Finished difference Result 3410 states and 3823 transitions. [2024-10-13 22:44:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 170 [2024-10-13 22:44:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:27,264 INFO L225 Difference]: With dead ends: 3410 [2024-10-13 22:44:27,264 INFO L226 Difference]: Without dead ends: 1416 [2024-10-13 22:44:27,266 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-10-13 22:44:27,268 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:27,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 17 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:44:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-10-13 22:44:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2024-10-13 22:44:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0742049469964665) internal successors, (1520), 1415 states have internal predecessors, (1520), 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-10-13 22:44:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1520 transitions. [2024-10-13 22:44:27,284 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1520 transitions. Word has length 170 [2024-10-13 22:44:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:27,284 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1520 transitions. [2024-10-13 22:44:27,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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-10-13 22:44:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1520 transitions. [2024-10-13 22:44:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 22:44:27,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:27,286 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:44:27,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:27,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1648442681, now seen corresponding path program 1 times [2024-10-13 22:44:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370542944] [2024-10-13 22:44:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370542944] [2024-10-13 22:44:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370542944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:44:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326431786] [2024-10-13 22:44:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:44:27,360 INFO L87 Difference]: Start difference. First operand 1416 states and 1520 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-10-13 22:44:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:27,634 INFO L93 Difference]: Finished difference Result 3108 states and 3342 transitions. [2024-10-13 22:44:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 188 [2024-10-13 22:44:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:27,635 INFO L225 Difference]: With dead ends: 3108 [2024-10-13 22:44:27,635 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:44:27,637 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-10-13 22:44:27,637 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:27,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 26 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:44:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:44:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:44:27,642 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-10-13 22:44:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:44:27,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2024-10-13 22:44:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:44:27,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-10-13 22:44:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:44:27,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:44:27,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:44:27,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:44:27,651 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:27,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:44:27,811 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:44:27,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:44:27 BoogieIcfgContainer [2024-10-13 22:44:27,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:44:27,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:44:27,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:44:27,838 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:44:27,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:44:23" (3/4) ... [2024-10-13 22:44:27,841 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:44:27,859 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 22:44:27,860 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 22:44:27,860 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:44:27,861 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:44:27,954 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:44:27,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:44:27,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:44:27,955 INFO L158 Benchmark]: Toolchain (without parser) took 6738.79ms. Allocated memory was 169.9MB in the beginning and 264.2MB in the end (delta: 94.4MB). Free memory was 116.1MB in the beginning and 176.8MB in the end (delta: -60.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,956 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:44:27,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 683.25ms. Allocated memory is still 169.9MB. Free memory was 116.1MB in the beginning and 131.7MB in the end (delta: -15.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.95ms. Allocated memory is still 169.9MB. Free memory was 131.7MB in the beginning and 126.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,956 INFO L158 Benchmark]: Boogie Preprocessor took 54.73ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 121.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,957 INFO L158 Benchmark]: RCFGBuilder took 1426.59ms. Allocated memory was 169.9MB in the beginning and 207.6MB in the end (delta: 37.7MB). Free memory was 121.2MB in the beginning and 168.8MB in the end (delta: -47.6MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,957 INFO L158 Benchmark]: TraceAbstraction took 4398.75ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 168.1MB in the beginning and 189.4MB in the end (delta: -21.3MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,957 INFO L158 Benchmark]: Witness Printer took 117.60ms. Allocated memory is still 264.2MB. Free memory was 189.4MB in the beginning and 176.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:44:27,959 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.13ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 683.25ms. Allocated memory is still 169.9MB. Free memory was 116.1MB in the beginning and 131.7MB in the end (delta: -15.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.95ms. Allocated memory is still 169.9MB. Free memory was 131.7MB in the beginning and 126.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.73ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 121.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1426.59ms. Allocated memory was 169.9MB in the beginning and 207.6MB in the end (delta: 37.7MB). Free memory was 121.2MB in the beginning and 168.8MB in the end (delta: -47.6MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4398.75ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 168.1MB in the beginning and 189.4MB in the end (delta: -21.3MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 117.60ms. Allocated memory is still 264.2MB. Free memory was 189.4MB in the beginning and 176.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 533]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 1056 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 438 mSolverCounterUnsat, 968 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1853occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1164 ConstructedInterpolants, 0 QuantifiedInterpolants, 1971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 311/311 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: 616]: Loop Invariant Derived loop invariant: (((((((((a17 <= 8) && (a28 <= 10)) && (a19 == 1)) || ((a28 == 10) && (a17 <= 8))) || (((a17 <= 8) && (a28 <= 10)) && (a11 != 1))) || ((a28 == 10) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || (((a25 == 1) && (a17 <= 8)) && (a28 <= 10))) || ((((a25 == 1) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 22:44:27,992 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