./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label51.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd --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 df07a51f7e516d27edfc43ba7975842330a5e8f5d0694898dfea4c8b236ae732 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:57:22,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:57:22,083 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:57:22,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:57:22,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:57:22,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:57:22,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:57:22,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:57:22,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:57:22,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:57:22,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:57:22,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:57:22,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:57:22,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:57:22,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:57:22,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:57:22,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:57:22,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:57:22,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:57:22,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd 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 -> df07a51f7e516d27edfc43ba7975842330a5e8f5d0694898dfea4c8b236ae732 [2024-11-13 12:57:22,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:57:22,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:57:22,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:57:22,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:57:22,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:57:22,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/eca-rers2012/Problem02_label51.c Unable to find full path for "g++" [2024-11-13 12:57:24,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:57:24,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:57:24,882 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/sv-benchmarks/c/eca-rers2012/Problem02_label51.c [2024-11-13 12:57:24,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/data/4f9fcb7e5/db63437744fd40eaab0f771d849361a0/FLAGebd1b6fbc [2024-11-13 12:57:24,915 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/data/4f9fcb7e5/db63437744fd40eaab0f771d849361a0 [2024-11-13 12:57:24,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:57:24,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:57:24,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:57:24,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:57:24,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:57:24,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:57:24" (1/1) ... [2024-11-13 12:57:24,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635959bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:24, skipping insertion in model container [2024-11-13 12:57:24,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:57:24" (1/1) ... [2024-11-13 12:57:24,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:57:25,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/sv-benchmarks/c/eca-rers2012/Problem02_label51.c[17924,17937] [2024-11-13 12:57:25,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:57:25,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:57:25,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/sv-benchmarks/c/eca-rers2012/Problem02_label51.c[17924,17937] [2024-11-13 12:57:25,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:57:25,542 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:57:25,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25 WrapperNode [2024-11-13 12:57:25,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:57:25,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:57:25,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:57:25,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:57:25,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,635 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 12:57:25,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:57:25,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:57:25,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:57:25,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:57:25,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,702 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-13 12:57:25,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:57:25,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:57:25,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:57:25,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:57:25,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (1/1) ... [2024-11-13 12:57:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:57:25,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:57:25,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:57:25,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:57:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:57:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:57:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:57:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:57:25,972 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:57:25,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:57:27,586 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 12:57:27,587 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:57:27,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:57:27,618 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:57:27,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:57:27 BoogieIcfgContainer [2024-11-13 12:57:27,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:57:27,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:57:27,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:57:27,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:57:27,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:57:24" (1/3) ... [2024-11-13 12:57:27,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d6e500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:57:27, skipping insertion in model container [2024-11-13 12:57:27,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:25" (2/3) ... [2024-11-13 12:57:27,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d6e500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:57:27, skipping insertion in model container [2024-11-13 12:57:27,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:57:27" (3/3) ... [2024-11-13 12:57:27,635 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51.c [2024-11-13 12:57:27,656 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:57:27,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label51.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:57:27,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:57:27,779 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;@4465ee20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:57:27,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:57:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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-13 12:57:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 12:57:27,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:27,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:57:27,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:27,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1425224189, now seen corresponding path program 1 times [2024-11-13 12:57:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:27,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065357423] [2024-11-13 12:57:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:28,746 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-13 12:57:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065357423] [2024-11-13 12:57:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065357423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:28,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:57:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821426290] [2024-11-13 12:57:28,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:28,795 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-13 12:57:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:29,984 INFO L93 Difference]: Finished difference Result 639 states and 1082 transitions. [2024-11-13 12:57:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2024-11-13 12:57:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:30,004 INFO L225 Difference]: With dead ends: 639 [2024-11-13 12:57:30,005 INFO L226 Difference]: Without dead ends: 318 [2024-11-13 12:57:30,009 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-13 12:57:30,012 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 99 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:30,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 136 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:57:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-13 12:57:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2024-11-13 12:57:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 312 states have internal predecessors, (459), 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-13 12:57:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 459 transitions. [2024-11-13 12:57:30,060 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 459 transitions. Word has length 110 [2024-11-13 12:57:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:30,061 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 459 transitions. [2024-11-13 12:57:30,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-13 12:57:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 459 transitions. [2024-11-13 12:57:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 12:57:30,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:30,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:57:30,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:57:30,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:30,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash -24193560, now seen corresponding path program 1 times [2024-11-13 12:57:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61193949] [2024-11-13 12:57:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:57:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61193949] [2024-11-13 12:57:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61193949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:30,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199133201] [2024-11-13 12:57:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:30,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:57:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:57:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:57:30,744 INFO L87 Difference]: Start difference. First operand 313 states and 459 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:57:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:31,899 INFO L93 Difference]: Finished difference Result 989 states and 1492 transitions. [2024-11-13 12:57:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:57:31,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-13 12:57:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:31,907 INFO L225 Difference]: With dead ends: 989 [2024-11-13 12:57:31,907 INFO L226 Difference]: Without dead ends: 595 [2024-11-13 12:57:31,908 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-13 12:57:31,909 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:31,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 107 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:57:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-13 12:57:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2024-11-13 12:57:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.3383838383838385) internal successors, (795), 594 states have internal predecessors, (795), 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-13 12:57:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 795 transitions. [2024-11-13 12:57:31,964 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 795 transitions. Word has length 114 [2024-11-13 12:57:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:31,964 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 795 transitions. [2024-11-13 12:57:31,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:57:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 795 transitions. [2024-11-13 12:57:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 12:57:31,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:31,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2024-11-13 12:57:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:57:31,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash -613403787, now seen corresponding path program 1 times [2024-11-13 12:57:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153724778] [2024-11-13 12:57:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 12:57:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153724778] [2024-11-13 12:57:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153724778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:57:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447384000] [2024-11-13 12:57:32,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:32,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:32,257 INFO L87 Difference]: Start difference. First operand 595 states and 795 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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-13 12:57:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:32,965 INFO L93 Difference]: Finished difference Result 1753 states and 2346 transitions. [2024-11-13 12:57:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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 140 [2024-11-13 12:57:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:32,971 INFO L225 Difference]: With dead ends: 1753 [2024-11-13 12:57:32,971 INFO L226 Difference]: Without dead ends: 1160 [2024-11-13 12:57:32,973 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-13 12:57:32,973 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:32,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 12:57:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-13 12:57:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157. [2024-11-13 12:57:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.208477508650519) internal successors, (1397), 1156 states have internal predecessors, (1397), 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-13 12:57:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1397 transitions. [2024-11-13 12:57:33,057 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1397 transitions. Word has length 140 [2024-11-13 12:57:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:33,057 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1397 transitions. [2024-11-13 12:57:33,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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-13 12:57:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1397 transitions. [2024-11-13 12:57:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 12:57:33,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:33,067 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:57:33,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:57:33,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -436780073, now seen corresponding path program 1 times [2024-11-13 12:57:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219343989] [2024-11-13 12:57:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 12:57:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219343989] [2024-11-13 12:57:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219343989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:33,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:33,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:33,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093306670] [2024-11-13 12:57:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:33,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:33,379 INFO L87 Difference]: Start difference. First operand 1157 states and 1397 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-13 12:57:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:34,002 INFO L93 Difference]: Finished difference Result 2885 states and 3530 transitions. [2024-11-13 12:57:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 148 [2024-11-13 12:57:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:34,030 INFO L225 Difference]: With dead ends: 2885 [2024-11-13 12:57:34,031 INFO L226 Difference]: Without dead ends: 1730 [2024-11-13 12:57:34,033 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-13 12:57:34,036 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 155 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:34,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 251 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:57:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-11-13 12:57:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1588. [2024-11-13 12:57:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 1.1846250787649653) internal successors, (1880), 1587 states have internal predecessors, (1880), 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-13 12:57:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1880 transitions. [2024-11-13 12:57:34,107 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1880 transitions. Word has length 148 [2024-11-13 12:57:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:34,108 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 1880 transitions. [2024-11-13 12:57:34,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-13 12:57:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1880 transitions. [2024-11-13 12:57:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:57:34,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:34,118 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:57:34,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:57:34,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2016945733, now seen corresponding path program 1 times [2024-11-13 12:57:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689668064] [2024-11-13 12:57:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:57:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689668064] [2024-11-13 12:57:34,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689668064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:34,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478588819] [2024-11-13 12:57:34,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:34,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:34,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:34,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:34,339 INFO L87 Difference]: Start difference. First operand 1588 states and 1880 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-13 12:57:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:35,012 INFO L93 Difference]: Finished difference Result 3880 states and 4676 transitions. [2024-11-13 12:57:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:35,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2024-11-13 12:57:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:35,022 INFO L225 Difference]: With dead ends: 3880 [2024-11-13 12:57:35,022 INFO L226 Difference]: Without dead ends: 2294 [2024-11-13 12:57:35,024 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-13 12:57:35,026 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 115 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:35,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 269 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:57:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2024-11-13 12:57:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2289. [2024-11-13 12:57:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2288 states have (on average 1.1477272727272727) internal successors, (2626), 2288 states have internal predecessors, (2626), 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-13 12:57:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 2626 transitions. [2024-11-13 12:57:35,090 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 2626 transitions. Word has length 151 [2024-11-13 12:57:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 2289 states and 2626 transitions. [2024-11-13 12:57:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-13 12:57:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 2626 transitions. [2024-11-13 12:57:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 12:57:35,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:35,100 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:57:35,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:57:35,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:35,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1227304363, now seen corresponding path program 1 times [2024-11-13 12:57:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249917690] [2024-11-13 12:57:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 12:57:35,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249917690] [2024-11-13 12:57:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249917690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:35,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290420949] [2024-11-13 12:57:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:35,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:35,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:35,324 INFO L87 Difference]: Start difference. First operand 2289 states and 2626 transitions. Second operand has 3 states, 3 states have (on average 52.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-13 12:57:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:35,988 INFO L93 Difference]: Finished difference Result 5418 states and 6326 transitions. [2024-11-13 12:57:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.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 163 [2024-11-13 12:57:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:36,000 INFO L225 Difference]: With dead ends: 5418 [2024-11-13 12:57:36,001 INFO L226 Difference]: Without dead ends: 3131 [2024-11-13 12:57:36,004 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-13 12:57:36,004 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:36,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 247 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:57:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2024-11-13 12:57:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2991. [2024-11-13 12:57:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2990 states have (on average 1.1381270903010035) internal successors, (3403), 2990 states have internal predecessors, (3403), 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-13 12:57:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 3403 transitions. [2024-11-13 12:57:36,087 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 3403 transitions. Word has length 163 [2024-11-13 12:57:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:36,088 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 3403 transitions. [2024-11-13 12:57:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.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-13 12:57:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 3403 transitions. [2024-11-13 12:57:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 12:57:36,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:36,096 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:57:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:57:36,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -879387523, now seen corresponding path program 1 times [2024-11-13 12:57:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356193966] [2024-11-13 12:57:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-13 12:57:36,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:36,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356193966] [2024-11-13 12:57:36,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356193966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970861312] [2024-11-13 12:57:36,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:36,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:36,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:36,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:36,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:36,316 INFO L87 Difference]: Start difference. First operand 2991 states and 3403 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-13 12:57:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:36,943 INFO L93 Difference]: Finished difference Result 6125 states and 6957 transitions. [2024-11-13 12:57:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:36,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 182 [2024-11-13 12:57:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:36,958 INFO L225 Difference]: With dead ends: 6125 [2024-11-13 12:57:36,958 INFO L226 Difference]: Without dead ends: 2856 [2024-11-13 12:57:36,962 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-13 12:57:36,965 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:36,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 54 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:57:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2024-11-13 12:57:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2711. [2024-11-13 12:57:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.0974169741697417) internal successors, (2974), 2710 states have internal predecessors, (2974), 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-13 12:57:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 2974 transitions. [2024-11-13 12:57:37,094 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 2974 transitions. Word has length 182 [2024-11-13 12:57:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:37,094 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 2974 transitions. [2024-11-13 12:57:37,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-13 12:57:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 2974 transitions. [2024-11-13 12:57:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 12:57:37,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:37,101 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:57:37,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:57:37,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:37,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:37,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2058502787, now seen corresponding path program 1 times [2024-11-13 12:57:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:37,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721179872] [2024-11-13 12:57:37,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:57:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721179872] [2024-11-13 12:57:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721179872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:37,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483569086] [2024-11-13 12:57:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:37,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:37,268 INFO L87 Difference]: Start difference. First operand 2711 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-13 12:57:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:37,855 INFO L93 Difference]: Finished difference Result 5563 states and 6098 transitions. [2024-11-13 12:57:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:37,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 184 [2024-11-13 12:57:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:37,903 INFO L225 Difference]: With dead ends: 5563 [2024-11-13 12:57:37,903 INFO L226 Difference]: Without dead ends: 2714 [2024-11-13 12:57:37,907 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-13 12:57:37,907 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 104 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:37,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 248 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:57:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2024-11-13 12:57:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2564. [2024-11-13 12:57:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2563 states have (on average 1.0792040577448303) internal successors, (2766), 2563 states have internal predecessors, (2766), 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-13 12:57:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 2766 transitions. [2024-11-13 12:57:37,971 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 2766 transitions. Word has length 184 [2024-11-13 12:57:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:37,972 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 2766 transitions. [2024-11-13 12:57:37,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-13 12:57:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 2766 transitions. [2024-11-13 12:57:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 12:57:37,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:37,979 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:57:37,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:57:37,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:37,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 167489710, now seen corresponding path program 1 times [2024-11-13 12:57:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924906368] [2024-11-13 12:57:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 12:57:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:38,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924906368] [2024-11-13 12:57:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924906368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248086155] [2024-11-13 12:57:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:38,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:38,160 INFO L87 Difference]: Start difference. First operand 2564 states and 2766 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-13 12:57:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:38,805 INFO L93 Difference]: Finished difference Result 5687 states and 6182 transitions. [2024-11-13 12:57:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-11-13 12:57:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:38,820 INFO L225 Difference]: With dead ends: 5687 [2024-11-13 12:57:38,820 INFO L226 Difference]: Without dead ends: 3125 [2024-11-13 12:57:38,823 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-13 12:57:38,823 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 134 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:38,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 216 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:57:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2024-11-13 12:57:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3124. [2024-11-13 12:57:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.079410822926673) internal successors, (3371), 3123 states have internal predecessors, (3371), 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-13 12:57:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 3371 transitions. [2024-11-13 12:57:38,899 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 3371 transitions. Word has length 188 [2024-11-13 12:57:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:38,900 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 3371 transitions. [2024-11-13 12:57:38,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-13 12:57:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 3371 transitions. [2024-11-13 12:57:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 12:57:38,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:38,907 INFO L215 NwaCegarLoop]: trace histogram [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, 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-13 12:57:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:57:38,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2098432362, now seen corresponding path program 1 times [2024-11-13 12:57:38,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:57:38,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839324921] [2024-11-13 12:57:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:57:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-13 12:57:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:57:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839324921] [2024-11-13 12:57:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839324921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:57:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:57:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:57:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355807884] [2024-11-13 12:57:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:57:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:57:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:57:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:57:39,136 INFO L87 Difference]: Start difference. First operand 3124 states and 3371 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-13 12:57:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:39,672 INFO L93 Difference]: Finished difference Result 5387 states and 5788 transitions. [2024-11-13 12:57:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:57:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 211 [2024-11-13 12:57:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:39,674 INFO L225 Difference]: With dead ends: 5387 [2024-11-13 12:57:39,674 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 12:57:39,678 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-13 12:57:39,679 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:39,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 61 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:57:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 12:57:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 12:57:39,682 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-13 12:57:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 12:57:39,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2024-11-13 12:57:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:39,682 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:57:39,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-13 12:57:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 12:57:39,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 12:57:39,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:57:39,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:57:39,690 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:57:39,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 12:57:40,063 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:57:40,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:57:40 BoogieIcfgContainer [2024-11-13 12:57:40,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:57:40,090 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:57:40,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:57:40,090 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:57:40,091 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:57:27" (3/4) ... [2024-11-13 12:57:40,094 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 12:57:40,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 12:57:40,124 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 12:57:40,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 12:57:40,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 12:57:40,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:57:40,303 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 12:57:40,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:57:40,304 INFO L158 Benchmark]: Toolchain (without parser) took 15383.37ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 90.7MB in the beginning and 110.1MB in the end (delta: -19.4MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2024-11-13 12:57:40,304 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:57:40,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.81ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 64.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:57:40,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.61ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:57:40,305 INFO L158 Benchmark]: Boogie Preprocessor took 153.57ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 54.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:57:40,305 INFO L158 Benchmark]: RCFGBuilder took 1828.93ms. Allocated memory is still 117.4MB. Free memory was 54.6MB in the beginning and 83.7MB in the end (delta: -29.1MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-13 12:57:40,305 INFO L158 Benchmark]: TraceAbstraction took 12467.05ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 83.0MB in the beginning and 121.0MB in the end (delta: -38.0MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-11-13 12:57:40,306 INFO L158 Benchmark]: Witness Printer took 212.70ms. Allocated memory is still 226.5MB. Free memory was 121.0MB in the beginning and 110.1MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:57:40,308 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.43ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.81ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 64.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.61ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.57ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 54.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1828.93ms. Allocated memory is still 117.4MB. Free memory was 54.6MB in the beginning and 83.7MB in the end (delta: -29.1MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12467.05ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 83.0MB in the beginning and 121.0MB in the end (delta: -38.0MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Witness Printer took 212.70ms. Allocated memory is still 226.5MB. Free memory was 121.0MB in the beginning and 110.1MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. 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: 512]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1261 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1261 mSDsluCounter, 1718 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 719 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3882 IncrementalHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 719 mSolverCounterUnsat, 1523 mSDtfsCounter, 3882 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3124occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 591 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1591 NumberOfCodeBlocks, 1591 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1581 ConstructedInterpolants, 0 QuantifiedInterpolants, 3969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 736/736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((a19 == 0) && (a28 <= 7)) || ((((a19 == 0) && (9 <= a28)) && (a25 == 1)) && (a28 <= 10))) || ((a19 == 0) && (a25 <= 0))) || (((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 <= 7)) && (a25 <= 0))) || ((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1))) || ((a25 == 1) && (a19 == 1))) || ((((9 <= a28) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-13 12:57:40,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c676e4e-4e80-42da-a00a-56469fe07637/bin/uautomizer-verify-qhAvR1uOyd/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