./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem02_label31.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label31.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:55:03,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:55:03,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:55:03,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:55:03,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:55:03,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:55:03,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:55:03,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:55:03,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:55:03,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:55:03,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:55:03,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:55:03,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:55:03,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:55:03,463 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:55:03,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:55:03,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:55:03,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:55:03,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:55:03,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:55:03,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:55:03,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:55:03,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:55:03,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:55:03,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:55:03,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:55:03,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:03,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:55:03,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:55:03,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:55:03,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:55:03,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:55:03,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:55:03,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:55:03,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:55:03,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:55:03,468 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599 [2024-11-06 18:55:03,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:55:03,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:55:03,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:55:03,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:55:03,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:55:03,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label31.c [2024-11-06 18:55:05,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:55:05,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:55:05,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label31.c [2024-11-06 18:55:05,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d078cb1/dccbc464c65141618b5c988be914d5a5/FLAG45ed0cee4 [2024-11-06 18:55:05,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d078cb1/dccbc464c65141618b5c988be914d5a5 [2024-11-06 18:55:05,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:55:05,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:55:05,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:05,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:55:05,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:55:05,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23322260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05, skipping insertion in model container [2024-11-06 18:55:05,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:55:05,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label31.c[18601,18614] [2024-11-06 18:55:05,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:06,010 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:55:06,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label31.c[18601,18614] [2024-11-06 18:55:06,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:06,113 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:55:06,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06 WrapperNode [2024-11-06 18:55:06,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:06,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:06,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:55:06,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:55:06,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,184 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-06 18:55:06,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:06,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:55:06,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:55:06,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:55:06,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,225 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-06 18:55:06,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:55:06,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:55:06,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:55:06,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:55:06,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (1/1) ... [2024-11-06 18:55:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:06,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:06,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 18:55:06,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 18:55:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:55:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:55:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:55:06,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:55:06,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:55:06,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:55:07,546 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 18:55:07,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:55:07,565 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:55:07,567 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:55:07,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:07 BoogieIcfgContainer [2024-11-06 18:55:07,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:55:07,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:55:07,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:55:07,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:55:07,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:55:05" (1/3) ... [2024-11-06 18:55:07,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56798298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:07, skipping insertion in model container [2024-11-06 18:55:07,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:06" (2/3) ... [2024-11-06 18:55:07,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56798298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:07, skipping insertion in model container [2024-11-06 18:55:07,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:07" (3/3) ... [2024-11-06 18:55:07,577 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label31.c [2024-11-06 18:55:07,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:55:07,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:55:07,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:55:07,666 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;@1a7c6a6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:55:07,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:55:07,674 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-06 18:55:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 18:55:07,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:07,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:07,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:07,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1691815701, now seen corresponding path program 1 times [2024-11-06 18:55:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597562884] [2024-11-06 18:55:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:08,249 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-06 18:55:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597562884] [2024-11-06 18:55:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597562884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:08,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31391939] [2024-11-06 18:55:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:08,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:08,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:08,287 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 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:09,105 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2024-11-06 18:55:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-06 18:55:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:09,119 INFO L225 Difference]: With dead ends: 601 [2024-11-06 18:55:09,119 INFO L226 Difference]: Without dead ends: 310 [2024-11-06 18:55:09,124 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-06 18:55:09,130 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:09,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 116 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:55:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-06 18:55:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-06 18:55:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 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-06 18:55:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-06 18:55:09,183 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 116 [2024-11-06 18:55:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-06 18:55:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-06 18:55:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-06 18:55:09,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:09,194 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:09,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:55:09,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:09,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -306269546, now seen corresponding path program 1 times [2024-11-06 18:55:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930899558] [2024-11-06 18:55:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930899558] [2024-11-06 18:55:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930899558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:09,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895037299] [2024-11-06 18:55:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:09,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:09,440 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:09,962 INFO L93 Difference]: Finished difference Result 911 states and 1313 transitions. [2024-11-06 18:55:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-06 18:55:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:09,968 INFO L225 Difference]: With dead ends: 911 [2024-11-06 18:55:09,968 INFO L226 Difference]: Without dead ends: 603 [2024-11-06 18:55:09,970 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-06 18:55:09,971 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:09,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 98 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-06 18:55:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2024-11-06 18:55:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3953098827470687) internal successors, (833), 597 states have internal predecessors, (833), 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-06 18:55:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2024-11-06 18:55:10,014 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 134 [2024-11-06 18:55:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:10,015 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2024-11-06 18:55:10,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2024-11-06 18:55:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-06 18:55:10,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:10,022 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:55:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:55:10,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 5389586, now seen corresponding path program 1 times [2024-11-06 18:55:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995516561] [2024-11-06 18:55:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995516561] [2024-11-06 18:55:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995516561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:10,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:10,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277529673] [2024-11-06 18:55:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:10,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:10,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:10,215 INFO L87 Difference]: Start difference. First operand 598 states and 833 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-06 18:55:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:10,703 INFO L93 Difference]: Finished difference Result 1755 states and 2451 transitions. [2024-11-06 18:55:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:10,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-11-06 18:55:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:10,710 INFO L225 Difference]: With dead ends: 1755 [2024-11-06 18:55:10,710 INFO L226 Difference]: Without dead ends: 1159 [2024-11-06 18:55:10,711 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-06 18:55:10,712 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 146 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:10,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 88 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-06 18:55:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2024-11-06 18:55:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.3419689119170986) internal successors, (1554), 1158 states have internal predecessors, (1554), 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-06 18:55:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1554 transitions. [2024-11-06 18:55:10,740 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1554 transitions. Word has length 144 [2024-11-06 18:55:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1554 transitions. [2024-11-06 18:55:10,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-06 18:55:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1554 transitions. [2024-11-06 18:55:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-06 18:55:10,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:10,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:55:10,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:55:10,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:10,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:10,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1535556893, now seen corresponding path program 1 times [2024-11-06 18:55:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:10,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532598771] [2024-11-06 18:55:10,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532598771] [2024-11-06 18:55:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532598771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067012345] [2024-11-06 18:55:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:10,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:10,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:10,907 INFO L87 Difference]: Start difference. First operand 1159 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-06 18:55:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:11,406 INFO L93 Difference]: Finished difference Result 3454 states and 4636 transitions. [2024-11-06 18:55:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 145 [2024-11-06 18:55:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:11,416 INFO L225 Difference]: With dead ends: 3454 [2024-11-06 18:55:11,416 INFO L226 Difference]: Without dead ends: 2297 [2024-11-06 18:55:11,419 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-06 18:55:11,420 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 176 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:11,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 90 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-06 18:55:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2295. [2024-11-06 18:55:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2903225806451613) internal successors, (2960), 2294 states have internal predecessors, (2960), 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-06 18:55:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2960 transitions. [2024-11-06 18:55:11,472 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2960 transitions. Word has length 145 [2024-11-06 18:55:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:11,472 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2960 transitions. [2024-11-06 18:55:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-06 18:55:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2960 transitions. [2024-11-06 18:55:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-06 18:55:11,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:11,478 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:11,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:55:11,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:11,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1601879897, now seen corresponding path program 1 times [2024-11-06 18:55:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012043060] [2024-11-06 18:55:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:55:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012043060] [2024-11-06 18:55:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012043060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501040508] [2024-11-06 18:55:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:11,586 INFO L87 Difference]: Start difference. First operand 2295 states and 2960 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-06 18:55:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:12,088 INFO L93 Difference]: Finished difference Result 4588 states and 5920 transitions. [2024-11-06 18:55:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 149 [2024-11-06 18:55:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:12,098 INFO L225 Difference]: With dead ends: 4588 [2024-11-06 18:55:12,099 INFO L226 Difference]: Without dead ends: 2295 [2024-11-06 18:55:12,102 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-06 18:55:12,105 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 162 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:12,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 270 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2024-11-06 18:55:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2286. [2024-11-06 18:55:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 2285 states have (on average 1.2280087527352297) internal successors, (2806), 2285 states have internal predecessors, (2806), 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-06 18:55:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 2806 transitions. [2024-11-06 18:55:12,154 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 2806 transitions. Word has length 149 [2024-11-06 18:55:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:12,155 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 2806 transitions. [2024-11-06 18:55:12,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-06 18:55:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2806 transitions. [2024-11-06 18:55:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-06 18:55:12,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:12,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:55:12,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:55:12,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 256350590, now seen corresponding path program 1 times [2024-11-06 18:55:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862267428] [2024-11-06 18:55:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862267428] [2024-11-06 18:55:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862267428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:12,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:12,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:12,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642987614] [2024-11-06 18:55:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:12,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:12,271 INFO L87 Difference]: Start difference. First operand 2286 states and 2806 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:12,735 INFO L93 Difference]: Finished difference Result 4414 states and 5399 transitions. [2024-11-06 18:55:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-06 18:55:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:12,747 INFO L225 Difference]: With dead ends: 4414 [2024-11-06 18:55:12,748 INFO L226 Difference]: Without dead ends: 2130 [2024-11-06 18:55:12,751 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-06 18:55:12,753 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 124 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:12,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 251 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2024-11-06 18:55:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1430. [2024-11-06 18:55:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 1.1637508747375787) internal successors, (1663), 1429 states have internal predecessors, (1663), 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-06 18:55:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1663 transitions. [2024-11-06 18:55:12,788 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1663 transitions. Word has length 152 [2024-11-06 18:55:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:12,788 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1663 transitions. [2024-11-06 18:55:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1663 transitions. [2024-11-06 18:55:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-06 18:55:12,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:12,794 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, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:55:12,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1547050092, now seen corresponding path program 1 times [2024-11-06 18:55:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498832068] [2024-11-06 18:55:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:12,922 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-06 18:55:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498832068] [2024-11-06 18:55:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498832068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399769623] [2024-11-06 18:55:12,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:12,924 INFO L87 Difference]: Start difference. First operand 1430 states and 1663 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-06 18:55:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:13,396 INFO L93 Difference]: Finished difference Result 3279 states and 3806 transitions. [2024-11-06 18:55:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 157 [2024-11-06 18:55:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:13,405 INFO L225 Difference]: With dead ends: 3279 [2024-11-06 18:55:13,405 INFO L226 Difference]: Without dead ends: 1709 [2024-11-06 18:55:13,407 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-06 18:55:13,409 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 115 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:13,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 253 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-11-06 18:55:13,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1708. [2024-11-06 18:55:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1707 states have (on average 1.121851200937317) internal successors, (1915), 1707 states have internal predecessors, (1915), 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-06 18:55:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1915 transitions. [2024-11-06 18:55:13,442 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1915 transitions. Word has length 157 [2024-11-06 18:55:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:13,443 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 1915 transitions. [2024-11-06 18:55:13,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-06 18:55:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1915 transitions. [2024-11-06 18:55:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-06 18:55:13,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:13,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:55:13,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:55:13,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:13,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1921855434, now seen corresponding path program 1 times [2024-11-06 18:55:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387575402] [2024-11-06 18:55:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:13,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:13,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387575402] [2024-11-06 18:55:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387575402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037213101] [2024-11-06 18:55:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:13,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:13,582 INFO L87 Difference]: Start difference. First operand 1708 states and 1915 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:14,060 INFO L93 Difference]: Finished difference Result 4115 states and 4608 transitions. [2024-11-06 18:55:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-11-06 18:55:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:14,069 INFO L225 Difference]: With dead ends: 4115 [2024-11-06 18:55:14,070 INFO L226 Difference]: Without dead ends: 2409 [2024-11-06 18:55:14,073 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-06 18:55:14,073 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 138 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:14,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 214 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-11-06 18:55:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2268. [2024-11-06 18:55:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2267 states have (on average 1.1001323334803705) internal successors, (2494), 2267 states have internal predecessors, (2494), 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-06 18:55:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2494 transitions. [2024-11-06 18:55:14,127 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2494 transitions. Word has length 178 [2024-11-06 18:55:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:14,127 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 2494 transitions. [2024-11-06 18:55:14,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2494 transitions. [2024-11-06 18:55:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-06 18:55:14,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:14,133 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:55:14,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:55:14,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:14,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1255881550, now seen corresponding path program 1 times [2024-11-06 18:55:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275877551] [2024-11-06 18:55:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-06 18:55:14,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275877551] [2024-11-06 18:55:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275877551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:14,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839622599] [2024-11-06 18:55:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:14,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:14,277 INFO L87 Difference]: Start difference. First operand 2268 states and 2494 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:14,527 INFO L93 Difference]: Finished difference Result 4242 states and 4664 transitions. [2024-11-06 18:55:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:14,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2024-11-06 18:55:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:14,529 INFO L225 Difference]: With dead ends: 4242 [2024-11-06 18:55:14,529 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:55:14,533 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-06 18:55:14,535 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:14,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 18 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:55:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:55:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:55:14,537 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-06 18:55:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:55:14,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2024-11-06 18:55:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:55:14,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:55:14,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:55:14,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:55:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:55:14,544 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:14,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:55:14,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:55:14,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:55:14 BoogieIcfgContainer [2024-11-06 18:55:14,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:55:14,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:55:14,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:55:14,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:55:14,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:07" (3/4) ... [2024-11-06 18:55:14,798 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:55:14,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:55:14,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:55:14,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:55:14,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:55:14,946 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:55:14,946 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:55:14,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:55:14,948 INFO L158 Benchmark]: Toolchain (without parser) took 9266.58ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 90.4MB in the beginning and 114.9MB in the end (delta: -24.5MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-06 18:55:14,948 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:14,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.54ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 64.3MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:55:14,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.07ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 59.1MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:14,949 INFO L158 Benchmark]: Boogie Preprocessor took 108.73ms. Allocated memory is still 117.4MB. Free memory was 59.1MB in the beginning and 54.5MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:14,949 INFO L158 Benchmark]: RCFGBuilder took 1273.53ms. Allocated memory is still 117.4MB. Free memory was 54.5MB in the beginning and 67.6MB in the end (delta: -13.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-06 18:55:14,949 INFO L158 Benchmark]: TraceAbstraction took 7224.61ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 66.9MB in the beginning and 125.5MB in the end (delta: -58.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-06 18:55:14,950 INFO L158 Benchmark]: Witness Printer took 151.75ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 114.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:14,953 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.54ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 64.3MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.07ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 59.1MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.73ms. Allocated memory is still 117.4MB. Free memory was 59.1MB in the beginning and 54.5MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1273.53ms. Allocated memory is still 117.4MB. Free memory was 54.5MB in the beginning and 67.6MB in the end (delta: -13.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7224.61ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 66.9MB in the beginning and 125.5MB in the end (delta: -58.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 151.75ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 114.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 530]: 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: 6.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1335 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1335 mSDsluCounter, 1398 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3180 IncrementalHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 1251 mSDtfsCounter, 3180 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2295occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 858 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1361 ConstructedInterpolants, 0 QuantifiedInterpolants, 1953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 410/410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((a17 <= 8) && (a11 <= 0)) && (a19 == 1)) && (a25 <= 0)) || (((11 <= a28) && (a11 == 1)) && (a25 <= 0))) || ((((a25 == 1) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1))) || ((((a28 <= 9) && (a17 <= 8)) && (a11 <= 0)) && (a25 <= 0))) || (((a11 == 1) && (a17 <= 8)) && (a25 <= 0))) || ((a17 <= 8) && ((((a25 == 1) && (a11 == 1)) && (a19 == 1)) || (((a25 == 1) && (a28 <= 9)) && (a11 == 1))))) || ((((9 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a11 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:55:14,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE