./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.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 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 18:01:06,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:01:06,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:01:06,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:01:06,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:01:06,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:01:06,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:01:06,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:01:06,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:01:06,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:01:06,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:01:06,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:01:06,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:01:06,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:01:06,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:01:06,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:01:06,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:01:06,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:01:06,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:01:06,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:01:06,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:01:06,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:01:06,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:01:06,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:01:06,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:01:06,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:01:06,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:01:06,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:01:06,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:01:06,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:01:06,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:01:06,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:01:06,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:01:06,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:01:06,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:01:06,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:01:06,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:01:06,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:01:06,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:01:06,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:01:06,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:01:06,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:01:06,284 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 -> 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e [2024-11-19 18:01:06,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:01:06,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:01:06,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:01:06,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:01:06,593 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:01:06,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2024-11-19 18:01:08,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:01:08,444 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:01:08,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2024-11-19 18:01:08,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee18b51e/8b1238e35fd64a6b8daf142d2d1db365/FLAGc39bdfadc [2024-11-19 18:01:08,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee18b51e/8b1238e35fd64a6b8daf142d2d1db365 [2024-11-19 18:01:08,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:01:08,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:01:08,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:01:08,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:01:08,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:01:08,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:01:08" (1/1) ... [2024-11-19 18:01:08,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7c8a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:08, skipping insertion in model container [2024-11-19 18:01:08,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:01:08" (1/1) ... [2024-11-19 18:01:08,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:01:08,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c[4437,4450] [2024-11-19 18:01:08,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:01:08,982 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:01:09,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c[4437,4450] [2024-11-19 18:01:09,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:01:09,106 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:01:09,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09 WrapperNode [2024-11-19 18:01:09,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:01:09,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:01:09,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:01:09,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:01:09,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,200 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-19 18:01:09,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:01:09,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:01:09,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:01:09,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:01:09,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,255 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 18:01:09,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:01:09,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:01:09,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:01:09,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:01:09,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (1/1) ... [2024-11-19 18:01:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:01:09,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:01:09,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 18:01:09,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 18:01:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:01:09,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:01:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:01:09,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:01:09,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:01:09,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:01:10,622 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-19 18:01:10,623 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:01:10,650 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:01:10,651 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:01:10,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:01:10 BoogieIcfgContainer [2024-11-19 18:01:10,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:01:10,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:01:10,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:01:10,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:01:10,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:01:08" (1/3) ... [2024-11-19 18:01:10,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4539a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:01:10, skipping insertion in model container [2024-11-19 18:01:10,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:09" (2/3) ... [2024-11-19 18:01:10,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4539a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:01:10, skipping insertion in model container [2024-11-19 18:01:10,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:01:10" (3/3) ... [2024-11-19 18:01:10,661 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label45.c [2024-11-19 18:01:10,676 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:01:10,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:01:10,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:01:10,752 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;@6eb28a1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:01:10,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:01:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 18:01:10,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:10,765 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] [2024-11-19 18:01:10,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2024-11-19 18:01:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293784910] [2024-11-19 18:01:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:11,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293784910] [2024-11-19 18:01:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293784910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:11,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:11,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:01:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966920959] [2024-11-19 18:01:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:11,186 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:12,082 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-19 18:01:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 38 [2024-11-19 18:01:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:12,096 INFO L225 Difference]: With dead ends: 552 [2024-11-19 18:01:12,096 INFO L226 Difference]: Without dead ends: 282 [2024-11-19 18:01:12,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:12,104 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:12,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:01:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-19 18:01:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-19 18:01:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-19 18:01:12,158 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 38 [2024-11-19 18:01:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:12,159 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-19 18:01:12,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-19 18:01:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 18:01:12,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:12,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:12,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:01:12,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1778439955, now seen corresponding path program 1 times [2024-11-19 18:01:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119610377] [2024-11-19 18:01:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119610377] [2024-11-19 18:01:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119610377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:01:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977576509] [2024-11-19 18:01:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:12,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:12,674 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:13,236 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-19 18:01:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-19 18:01:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:13,240 INFO L225 Difference]: With dead ends: 701 [2024-11-19 18:01:13,242 INFO L226 Difference]: Without dead ends: 421 [2024-11-19 18:01:13,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:13,244 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:13,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:01:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-19 18:01:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-19 18:01:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-19 18:01:13,284 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 107 [2024-11-19 18:01:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:13,284 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-19 18:01:13,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-19 18:01:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 18:01:13,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:13,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:13,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:01:13,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:13,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -651687484, now seen corresponding path program 1 times [2024-11-19 18:01:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:13,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526962123] [2024-11-19 18:01:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526962123] [2024-11-19 18:01:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526962123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:13,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:13,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:01:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494327516] [2024-11-19 18:01:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:01:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:01:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:01:13,688 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:14,373 INFO L93 Difference]: Finished difference Result 998 states and 1484 transitions. [2024-11-19 18:01:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:01:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2024-11-19 18:01:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:14,378 INFO L225 Difference]: With dead ends: 998 [2024-11-19 18:01:14,378 INFO L226 Difference]: Without dead ends: 699 [2024-11-19 18:01:14,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:01:14,380 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:14,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 59 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:01:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-19 18:01:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-19 18:01:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.478510028653295) internal successors, (1032), 698 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1032 transitions. [2024-11-19 18:01:14,402 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1032 transitions. Word has length 113 [2024-11-19 18:01:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:14,403 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1032 transitions. [2024-11-19 18:01:14,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1032 transitions. [2024-11-19 18:01:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 18:01:14,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:14,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:14,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:01:14,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:14,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 715593968, now seen corresponding path program 1 times [2024-11-19 18:01:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129562091] [2024-11-19 18:01:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:14,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:14,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129562091] [2024-11-19 18:01:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129562091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:14,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:01:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581598677] [2024-11-19 18:01:14,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:14,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:14,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:14,556 INFO L87 Difference]: Start difference. First operand 699 states and 1032 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:15,047 INFO L93 Difference]: Finished difference Result 1952 states and 2918 transitions. [2024-11-19 18:01:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:15,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2024-11-19 18:01:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:15,053 INFO L225 Difference]: With dead ends: 1952 [2024-11-19 18:01:15,053 INFO L226 Difference]: Without dead ends: 1255 [2024-11-19 18:01:15,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:15,055 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:15,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:01:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-19 18:01:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 977. [2024-11-19 18:01:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3565573770491803) internal successors, (1324), 976 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1324 transitions. [2024-11-19 18:01:15,079 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1324 transitions. Word has length 132 [2024-11-19 18:01:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:15,079 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1324 transitions. [2024-11-19 18:01:15,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1324 transitions. [2024-11-19 18:01:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 18:01:15,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:15,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:15,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:01:15,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:15,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash -555992780, now seen corresponding path program 1 times [2024-11-19 18:01:15,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:15,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914128933] [2024-11-19 18:01:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:15,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914128933] [2024-11-19 18:01:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914128933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:01:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051747875] [2024-11-19 18:01:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:15,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:01:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:01:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:01:15,479 INFO L87 Difference]: Start difference. First operand 977 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:16,054 INFO L93 Difference]: Finished difference Result 1813 states and 2498 transitions. [2024-11-19 18:01:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:01:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 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 156 [2024-11-19 18:01:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:16,058 INFO L225 Difference]: With dead ends: 1813 [2024-11-19 18:01:16,058 INFO L226 Difference]: Without dead ends: 977 [2024-11-19 18:01:16,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:01:16,060 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:16,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 88 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:01:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-19 18:01:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-19 18:01:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3514344262295082) internal successors, (1319), 976 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1319 transitions. [2024-11-19 18:01:16,086 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1319 transitions. Word has length 156 [2024-11-19 18:01:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1319 transitions. [2024-11-19 18:01:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1319 transitions. [2024-11-19 18:01:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-19 18:01:16,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:16,090 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:01:16,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:01:16,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:16,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1954640871, now seen corresponding path program 1 times [2024-11-19 18:01:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288866906] [2024-11-19 18:01:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 18:01:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:16,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288866906] [2024-11-19 18:01:16,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288866906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:01:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482078254] [2024-11-19 18:01:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:16,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:16,217 INFO L87 Difference]: Start difference. First operand 977 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:16,704 INFO L93 Difference]: Finished difference Result 2230 states and 3079 transitions. [2024-11-19 18:01:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-11-19 18:01:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:16,713 INFO L225 Difference]: With dead ends: 2230 [2024-11-19 18:01:16,714 INFO L226 Difference]: Without dead ends: 1394 [2024-11-19 18:01:16,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:16,717 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:16,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:01:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-19 18:01:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-19 18:01:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.2814070351758795) internal successors, (1785), 1393 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1785 transitions. [2024-11-19 18:01:16,749 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1785 transitions. Word has length 173 [2024-11-19 18:01:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:16,750 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1785 transitions. [2024-11-19 18:01:16,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1785 transitions. [2024-11-19 18:01:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 18:01:16,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:16,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:01:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 18:01:16,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 510441368, now seen corresponding path program 1 times [2024-11-19 18:01:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411966711] [2024-11-19 18:01:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:16,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411966711] [2024-11-19 18:01:16,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411966711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:16,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:01:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432454193] [2024-11-19 18:01:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:16,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:16,920 INFO L87 Difference]: Start difference. First operand 1394 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:17,412 INFO L93 Difference]: Finished difference Result 3203 states and 4181 transitions. [2024-11-19 18:01:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 179 [2024-11-19 18:01:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:17,420 INFO L225 Difference]: With dead ends: 3203 [2024-11-19 18:01:17,420 INFO L226 Difference]: Without dead ends: 1950 [2024-11-19 18:01:17,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:17,423 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:17,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:01:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-19 18:01:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2024-11-19 18:01:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.24655894673848) internal successors, (2083), 1671 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2083 transitions. [2024-11-19 18:01:17,459 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2083 transitions. Word has length 179 [2024-11-19 18:01:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2083 transitions. [2024-11-19 18:01:17,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2083 transitions. [2024-11-19 18:01:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-19 18:01:17,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:17,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:01:17,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:01:17,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1308011704, now seen corresponding path program 1 times [2024-11-19 18:01:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776180648] [2024-11-19 18:01:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776180648] [2024-11-19 18:01:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776180648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:17,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:01:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104094612] [2024-11-19 18:01:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:17,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:17,669 INFO L87 Difference]: Start difference. First operand 1672 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:18,139 INFO L93 Difference]: Finished difference Result 3759 states and 4777 transitions. [2024-11-19 18:01:18,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:18,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 227 [2024-11-19 18:01:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:18,148 INFO L225 Difference]: With dead ends: 3759 [2024-11-19 18:01:18,149 INFO L226 Difference]: Without dead ends: 2228 [2024-11-19 18:01:18,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:18,153 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:18,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 189 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:01:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-19 18:01:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1811. [2024-11-19 18:01:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.181767955801105) internal successors, (2139), 1810 states have internal predecessors, (2139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2139 transitions. [2024-11-19 18:01:18,196 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2139 transitions. Word has length 227 [2024-11-19 18:01:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2139 transitions. [2024-11-19 18:01:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2139 transitions. [2024-11-19 18:01:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-19 18:01:18,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:18,200 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:18,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:01:18,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1226512020, now seen corresponding path program 1 times [2024-11-19 18:01:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108665179] [2024-11-19 18:01:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108665179] [2024-11-19 18:01:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108665179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:01:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392568662] [2024-11-19 18:01:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:01:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:01:18,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:01:18,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 18:01:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:19,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 18:01:19,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:01:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 18:01:20,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 18:01:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 18:01:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392568662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 18:01:22,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 18:01:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 18:01:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329768913] [2024-11-19 18:01:22,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 18:01:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 18:01:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 18:01:22,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 18:01:22,132 INFO L87 Difference]: Start difference. First operand 1811 states and 2139 transitions. Second operand has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:26,162 INFO L93 Difference]: Finished difference Result 7853 states and 9218 transitions. [2024-11-19 18:01:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 18:01:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 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 261 [2024-11-19 18:01:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:26,185 INFO L225 Difference]: With dead ends: 7853 [2024-11-19 18:01:26,185 INFO L226 Difference]: Without dead ends: 6183 [2024-11-19 18:01:26,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2024-11-19 18:01:26,190 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2454 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 4472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:26,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2454 Valid, 86 Invalid, 4472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 18:01:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2024-11-19 18:01:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 2506. [2024-11-19 18:01:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1572854291417165) internal successors, (2899), 2505 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2899 transitions. [2024-11-19 18:01:26,265 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2899 transitions. Word has length 261 [2024-11-19 18:01:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2899 transitions. [2024-11-19 18:01:26,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2899 transitions. [2024-11-19 18:01:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-19 18:01:26,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:26,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:01:26,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 18:01:26,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:01:26,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:26,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1065311159, now seen corresponding path program 1 times [2024-11-19 18:01:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803753125] [2024-11-19 18:01:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803753125] [2024-11-19 18:01:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803753125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:01:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855352403] [2024-11-19 18:01:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:01:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:01:26,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:01:26,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 18:01:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:27,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:01:27,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:01:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-19 18:01:27,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:01:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855352403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:01:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 18:01:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604542310] [2024-11-19 18:01:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:27,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:01:27,166 INFO L87 Difference]: Start difference. First operand 2506 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:27,611 INFO L93 Difference]: Finished difference Result 5427 states and 6384 transitions. [2024-11-19 18:01:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2024-11-19 18:01:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:27,625 INFO L225 Difference]: With dead ends: 5427 [2024-11-19 18:01:27,625 INFO L226 Difference]: Without dead ends: 3062 [2024-11-19 18:01:27,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:01:27,629 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 104 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:27,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 226 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:01:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2024-11-19 18:01:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2645. [2024-11-19 18:01:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1395612708018155) internal successors, (3013), 2644 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3013 transitions. [2024-11-19 18:01:27,685 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3013 transitions. Word has length 286 [2024-11-19 18:01:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:27,686 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3013 transitions. [2024-11-19 18:01:27,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3013 transitions. [2024-11-19 18:01:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-19 18:01:27,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:27,692 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:27,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 18:01:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 18:01:27,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:27,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1398974089, now seen corresponding path program 1 times [2024-11-19 18:01:27,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:27,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190285547] [2024-11-19 18:01:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 180 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:01:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190285547] [2024-11-19 18:01:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190285547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:01:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454600086] [2024-11-19 18:01:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:28,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:01:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:01:28,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:01:28,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 18:01:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:28,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:01:28,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:01:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 18:01:28,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:01:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454600086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:28,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:01:28,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 18:01:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803474045] [2024-11-19 18:01:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:28,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:28,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:01:28,693 INFO L87 Difference]: Start difference. First operand 2645 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:29,132 INFO L93 Difference]: Finished difference Result 5149 states and 5881 transitions. [2024-11-19 18:01:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 300 [2024-11-19 18:01:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:29,142 INFO L225 Difference]: With dead ends: 5149 [2024-11-19 18:01:29,143 INFO L226 Difference]: Without dead ends: 2645 [2024-11-19 18:01:29,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:01:29,146 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:29,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:01:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2024-11-19 18:01:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2024-11-19 18:01:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.126323751891074) internal successors, (2978), 2644 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 2978 transitions. [2024-11-19 18:01:29,193 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 2978 transitions. Word has length 300 [2024-11-19 18:01:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:29,194 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 2978 transitions. [2024-11-19 18:01:29,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 2978 transitions. [2024-11-19 18:01:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-19 18:01:29,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:01:29,200 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:29,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 18:01:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:01:29,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:01:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:01:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1472236450, now seen corresponding path program 1 times [2024-11-19 18:01:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:01:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720410151] [2024-11-19 18:01:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:01:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:01:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:01:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-19 18:01:29,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:01:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720410151] [2024-11-19 18:01:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720410151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:01:29,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:01:29,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:01:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822972314] [2024-11-19 18:01:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:01:29,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:01:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:01:29,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:01:29,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:29,590 INFO L87 Difference]: Start difference. First operand 2645 states and 2978 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-11-19 18:01:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:01:29,966 INFO L93 Difference]: Finished difference Result 5703 states and 6411 transitions. [2024-11-19 18:01:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:01:29,966 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 310 [2024-11-19 18:01:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:01:29,967 INFO L225 Difference]: With dead ends: 5703 [2024-11-19 18:01:29,967 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 18:01:29,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:01:29,971 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 104 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 18:01:29,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 223 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 18:01:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 18:01:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 18:01:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:01:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 18:01:29,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2024-11-19 18:01:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:01:29,972 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 18:01:29,973 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-11-19 18:01:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 18:01:29,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 18:01:29,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 18:01:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 18:01:29,979 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:01:29,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 18:01:30,502 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 18:01:30,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:01:30 BoogieIcfgContainer [2024-11-19 18:01:30,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 18:01:30,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 18:01:30,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 18:01:30,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 18:01:30,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:01:10" (3/4) ... [2024-11-19 18:01:30,525 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 18:01:30,547 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 18:01:30,548 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 18:01:30,549 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 18:01:30,549 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 18:01:30,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 18:01:30,688 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 18:01:30,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 18:01:30,689 INFO L158 Benchmark]: Toolchain (without parser) took 22190.15ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 114.8MB in the beginning and 229.2MB in the end (delta: -114.4MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,689 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 18:01:30,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.25ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 139.0MB in the end (delta: -24.3MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.86ms. Allocated memory is still 184.5MB. Free memory was 139.0MB in the beginning and 130.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,690 INFO L158 Benchmark]: Boogie Preprocessor took 110.05ms. Allocated memory is still 184.5MB. Free memory was 130.6MB in the beginning and 120.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,690 INFO L158 Benchmark]: RCFGBuilder took 1338.48ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 121.1MB in the end (delta: -973.5kB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,691 INFO L158 Benchmark]: TraceAbstraction took 19867.46ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 120.9MB in the beginning and 240.7MB in the end (delta: -119.8MB). Peak memory consumption was 233.2MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,691 INFO L158 Benchmark]: Witness Printer took 166.93ms. Allocated memory is still 436.2MB. Free memory was 240.7MB in the beginning and 229.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 18:01:30,692 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.22ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.25ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 139.0MB in the end (delta: -24.3MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.86ms. Allocated memory is still 184.5MB. Free memory was 139.0MB in the beginning and 130.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.05ms. Allocated memory is still 184.5MB. Free memory was 130.6MB in the beginning and 120.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1338.48ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 121.1MB in the end (delta: -973.5kB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19867.46ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 120.9MB in the beginning and 240.7MB in the end (delta: -119.8MB). Peak memory consumption was 233.2MB. Max. memory is 16.1GB. * Witness Printer took 166.93ms. Allocated memory is still 436.2MB. Free memory was 240.7MB in the beginning and 229.2MB in the end (delta: 11.5MB). 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: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3432 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3432 mSDsluCounter, 1345 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 1463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8181 IncrementalHoareTripleChecker+Invalid, 9644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1463 mSolverCounterUnsat, 1214 mSDtfsCounter, 8181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1157 GetRequests, 1113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 5067 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3129 NumberOfCodeBlocks, 3129 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3374 ConstructedInterpolants, 0 QuantifiedInterpolants, 17340 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 2279/2860 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (4 <= a10)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) || (((a10 <= 0) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || ((((a10 == 1) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (9 <= a19))) || ((((a19 == 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a10 == 2))) || ((((a10 == 0) && (a19 == 9)) && (14 == a4)) && (a12 == 0))) || (((((a19 == 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (14 == a4)) && (a12 == 0))) || (((0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a19 <= 7))) || ((((a19 <= 9) && (219 <= a1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-19 18:01:30,713 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