./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label35.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62d888471d056f6cd9411573d32e3ae9a40e666c4b036562384bced7989fece1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:58:17,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:58:17,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:58:17,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:58:17,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:58:17,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:58:17,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:58:17,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:58:17,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:58:17,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:58:17,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:58:17,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:58:17,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:58:17,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:58:17,793 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:58:17,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:58:17,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:58:17,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:58:17,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:58:17,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:58:17,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:58:17,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:58:17,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:58:17,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:58:17,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:58:17,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:58:17,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:58:17,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:58:17,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:58:17,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:58:17,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:58:17,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:58:17,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:17,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:58:17,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:58:17,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:58:17,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:58:17,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:58:17,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:58:17,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:58:17,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:58:17,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:58:17,804 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62d888471d056f6cd9411573d32e3ae9a40e666c4b036562384bced7989fece1 [2024-10-12 15:58:18,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:58:18,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:58:18,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:58:18,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:58:18,098 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:58:18,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label35.c [2024-10-12 15:58:19,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:58:19,908 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:58:19,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label35.c [2024-10-12 15:58:19,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63f59802/a2ebb82a21dc4e1f846a7b854d5c15f8/FLAG8f19c17a1 [2024-10-12 15:58:19,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63f59802/a2ebb82a21dc4e1f846a7b854d5c15f8 [2024-10-12 15:58:19,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:58:19,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:58:19,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:19,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:58:19,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:58:19,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c20375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19, skipping insertion in model container [2024-10-12 15:58:19,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:20,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:58:20,264 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label35.c[5864,5877] [2024-10-12 15:58:20,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:20,425 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:58:20,448 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label35.c[5864,5877] [2024-10-12 15:58:20,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:20,520 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:58:20,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20 WrapperNode [2024-10-12 15:58:20,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:20,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:20,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:58:20,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:58:20,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,609 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-12 15:58:20,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:20,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:58:20,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:58:20,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:58:20,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,662 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:58:20,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:58:20,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:58:20,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:58:20,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:58:20,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (1/1) ... [2024-10-12 15:58:20,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:20,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:20,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:58:20,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:58:20,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:58:20,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:58:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:58:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:58:21,008 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:58:21,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:58:22,145 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:58:22,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:58:22,210 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:58:22,211 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:58:22,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:22 BoogieIcfgContainer [2024-10-12 15:58:22,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:58:22,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:58:22,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:58:22,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:58:22,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:58:19" (1/3) ... [2024-10-12 15:58:22,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308ef85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:22, skipping insertion in model container [2024-10-12 15:58:22,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:20" (2/3) ... [2024-10-12 15:58:22,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308ef85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:22, skipping insertion in model container [2024-10-12 15:58:22,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:22" (3/3) ... [2024-10-12 15:58:22,224 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label35.c [2024-10-12 15:58:22,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:58:22,244 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:58:22,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:58:22,322 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;@60da1e4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:58:22,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:58:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 15:58:22,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:22,335 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] [2024-10-12 15:58:22,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -987680270, now seen corresponding path program 1 times [2024-10-12 15:58:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557065356] [2024-10-12 15:58:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557065356] [2024-10-12 15:58:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557065356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:22,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665926503] [2024-10-12 15:58:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:22,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:58:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:58:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:22,580 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:22,627 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-12 15:58:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:58:22,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2024-10-12 15:58:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:22,639 INFO L225 Difference]: With dead ends: 287 [2024-10-12 15:58:22,639 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:58:22,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:22,647 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:22,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:58:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:58:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-12 15:58:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-12 15:58:22,700 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 50 [2024-10-12 15:58:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:22,701 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-12 15:58:22,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-12 15:58:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 15:58:22,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:22,703 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] [2024-10-12 15:58:22,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:58:22,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -763675339, now seen corresponding path program 1 times [2024-10-12 15:58:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625613346] [2024-10-12 15:58:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:22,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625613346] [2024-10-12 15:58:22,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625613346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:22,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:22,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755428817] [2024-10-12 15:58:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:22,939 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:23,569 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-12 15:58:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2024-10-12 15:58:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:23,572 INFO L225 Difference]: With dead ends: 422 [2024-10-12 15:58:23,572 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 15:58:23,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:23,574 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 96 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:23,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:58:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 15:58:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-12 15:58:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-12 15:58:23,598 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 50 [2024-10-12 15:58:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:23,599 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-12 15:58:23,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-12 15:58:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 15:58:23,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:23,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:23,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:58:23,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2101200312, now seen corresponding path program 1 times [2024-10-12 15:58:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106330853] [2024-10-12 15:58:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:24,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106330853] [2024-10-12 15:58:24,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106330853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:24,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870056574] [2024-10-12 15:58:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:24,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:24,012 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:24,550 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-12 15:58:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:24,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-10-12 15:58:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:24,554 INFO L225 Difference]: With dead ends: 700 [2024-10-12 15:58:24,554 INFO L226 Difference]: Without dead ends: 420 [2024-10-12 15:58:24,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:24,557 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:24,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 19 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-12 15:58:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-12 15:58:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-12 15:58:24,582 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 116 [2024-10-12 15:58:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:24,582 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-12 15:58:24,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-12 15:58:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 15:58:24,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:24,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:58:24,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:24,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1277535432, now seen corresponding path program 1 times [2024-10-12 15:58:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406554481] [2024-10-12 15:58:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406554481] [2024-10-12 15:58:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406554481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:24,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:24,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209180361] [2024-10-12 15:58:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:24,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:24,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:24,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:24,897 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:25,325 INFO L93 Difference]: Finished difference Result 978 states and 1318 transitions. [2024-10-12 15:58:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-12 15:58:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:25,328 INFO L225 Difference]: With dead ends: 978 [2024-10-12 15:58:25,329 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:58:25,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:25,331 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:25,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:58:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:58:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3064516129032258) internal successors, (729), 558 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-12 15:58:25,351 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 133 [2024-10-12 15:58:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:25,352 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-12 15:58:25,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-12 15:58:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 15:58:25,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:25,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:25,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:58:25,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash 677295708, now seen corresponding path program 1 times [2024-10-12 15:58:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35099952] [2024-10-12 15:58:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35099952] [2024-10-12 15:58:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35099952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:25,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:25,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142795253] [2024-10-12 15:58:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:25,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:25,500 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:25,985 INFO L93 Difference]: Finished difference Result 1256 states and 1671 transitions. [2024-10-12 15:58:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:25,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-12 15:58:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:25,993 INFO L225 Difference]: With dead ends: 1256 [2024-10-12 15:58:25,993 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 15:58:25,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:25,995 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:25,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 32 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 15:58:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-12 15:58:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2284688995215312) internal successors, (1027), 836 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1027 transitions. [2024-10-12 15:58:26,018 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1027 transitions. Word has length 141 [2024-10-12 15:58:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:26,019 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1027 transitions. [2024-10-12 15:58:26,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1027 transitions. [2024-10-12 15:58:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-12 15:58:26,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:26,024 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:26,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:58:26,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:26,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash 576162005, now seen corresponding path program 1 times [2024-10-12 15:58:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930837221] [2024-10-12 15:58:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-12 15:58:26,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:26,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930837221] [2024-10-12 15:58:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930837221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322047253] [2024-10-12 15:58:26,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:26,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:26,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:26,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:26,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:58:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:26,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:26,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 15:58:26,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322047253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:26,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:58:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744608525] [2024-10-12 15:58:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:26,881 INFO L87 Difference]: Start difference. First operand 837 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:27,356 INFO L93 Difference]: Finished difference Result 1256 states and 1546 transitions. [2024-10-12 15:58:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:27,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 199 [2024-10-12 15:58:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:27,361 INFO L225 Difference]: With dead ends: 1256 [2024-10-12 15:58:27,362 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 15:58:27,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:27,363 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 96 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:27,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 9 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 15:58:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 976. [2024-10-12 15:58:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2471794871794872) internal successors, (1216), 975 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1216 transitions. [2024-10-12 15:58:27,383 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1216 transitions. Word has length 199 [2024-10-12 15:58:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:27,384 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1216 transitions. [2024-10-12 15:58:27,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1216 transitions. [2024-10-12 15:58:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 15:58:27,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:27,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:27,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:58:27,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 15:58:27,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:27,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash -151490116, now seen corresponding path program 1 times [2024-10-12 15:58:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:27,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486141906] [2024-10-12 15:58:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486141906] [2024-10-12 15:58:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486141906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195619628] [2024-10-12 15:58:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:27,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:27,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:27,813 INFO L87 Difference]: Start difference. First operand 976 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:28,275 INFO L93 Difference]: Finished difference Result 1951 states and 2466 transitions. [2024-10-12 15:58:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 253 [2024-10-12 15:58:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:28,280 INFO L225 Difference]: With dead ends: 1951 [2024-10-12 15:58:28,281 INFO L226 Difference]: Without dead ends: 1115 [2024-10-12 15:58:28,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:28,283 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:28,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 212 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-12 15:58:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-12 15:58:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2253141831238779) internal successors, (1365), 1114 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1365 transitions. [2024-10-12 15:58:28,327 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1365 transitions. Word has length 253 [2024-10-12 15:58:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:28,327 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1365 transitions. [2024-10-12 15:58:28,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1365 transitions. [2024-10-12 15:58:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-12 15:58:28,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:28,331 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:28,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:58:28,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:28,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1131584944, now seen corresponding path program 1 times [2024-10-12 15:58:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612906214] [2024-10-12 15:58:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:28,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612906214] [2024-10-12 15:58:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612906214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:58:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768765123] [2024-10-12 15:58:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:28,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:58:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:58:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:28,830 INFO L87 Difference]: Start difference. First operand 1115 states and 1365 transitions. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:29,404 INFO L93 Difference]: Finished difference Result 2145 states and 2640 transitions. [2024-10-12 15:58:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:58:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 6 states have internal predecessors, (262), 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 262 [2024-10-12 15:58:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:29,409 INFO L225 Difference]: With dead ends: 2145 [2024-10-12 15:58:29,409 INFO L226 Difference]: Without dead ends: 1115 [2024-10-12 15:58:29,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:29,412 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:29,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 24 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-12 15:58:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-12 15:58:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2190305206463197) internal successors, (1358), 1114 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1358 transitions. [2024-10-12 15:58:29,433 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1358 transitions. Word has length 262 [2024-10-12 15:58:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:29,434 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1358 transitions. [2024-10-12 15:58:29,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1358 transitions. [2024-10-12 15:58:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-12 15:58:29,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:29,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:29,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:58:29,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:29,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2036353142, now seen corresponding path program 1 times [2024-10-12 15:58:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:29,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524149669] [2024-10-12 15:58:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 31 proven. 66 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:58:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524149669] [2024-10-12 15:58:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524149669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447596728] [2024-10-12 15:58:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:29,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:29,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:29,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:58:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:29,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:29,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:58:30,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447596728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:30,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:30,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:58:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683285887] [2024-10-12 15:58:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:30,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:30,084 INFO L87 Difference]: Start difference. First operand 1115 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:30,530 INFO L93 Difference]: Finished difference Result 1673 states and 2023 transitions. [2024-10-12 15:58:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 298 [2024-10-12 15:58:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:30,536 INFO L225 Difference]: With dead ends: 1673 [2024-10-12 15:58:30,537 INFO L226 Difference]: Without dead ends: 1671 [2024-10-12 15:58:30,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:30,538 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:30,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 9 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-12 15:58:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1115. [2024-10-12 15:58:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2190305206463197) internal successors, (1358), 1114 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1358 transitions. [2024-10-12 15:58:30,566 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1358 transitions. Word has length 298 [2024-10-12 15:58:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:30,566 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1358 transitions. [2024-10-12 15:58:30,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1358 transitions. [2024-10-12 15:58:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-12 15:58:30,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:30,571 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:30,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:58:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-12 15:58:30,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -901716490, now seen corresponding path program 1 times [2024-10-12 15:58:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171175665] [2024-10-12 15:58:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 346 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:31,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171175665] [2024-10-12 15:58:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171175665] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777147195] [2024-10-12 15:58:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:31,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:31,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:58:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:31,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:31,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-12 15:58:31,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777147195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 15:58:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786610436] [2024-10-12 15:58:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:31,505 INFO L87 Difference]: Start difference. First operand 1115 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:32,011 INFO L93 Difference]: Finished difference Result 2785 states and 3438 transitions. [2024-10-12 15:58:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 350 [2024-10-12 15:58:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:32,018 INFO L225 Difference]: With dead ends: 2785 [2024-10-12 15:58:32,019 INFO L226 Difference]: Without dead ends: 1810 [2024-10-12 15:58:32,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:32,021 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:32,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 197 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-12 15:58:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-10-12 15:58:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.1818684355997788) internal successors, (2138), 1809 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2138 transitions. [2024-10-12 15:58:32,058 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2138 transitions. Word has length 350 [2024-10-12 15:58:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2138 transitions. [2024-10-12 15:58:32,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2138 transitions. [2024-10-12 15:58:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-12 15:58:32,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:32,065 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:32,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:58:32,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:32,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash -153885006, now seen corresponding path program 1 times [2024-10-12 15:58:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:32,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214013351] [2024-10-12 15:58:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 23 proven. 123 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-12 15:58:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214013351] [2024-10-12 15:58:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214013351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212394773] [2024-10-12 15:58:32,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:32,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:32,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:32,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:58:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:32,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:32,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-12 15:58:32,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212394773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:32,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:58:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969001161] [2024-10-12 15:58:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:32,942 INFO L87 Difference]: Start difference. First operand 1810 states and 2138 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:33,450 INFO L93 Difference]: Finished difference Result 3756 states and 4457 transitions. [2024-10-12 15:58:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:33,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 363 [2024-10-12 15:58:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:33,452 INFO L225 Difference]: With dead ends: 3756 [2024-10-12 15:58:33,452 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:58:33,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:33,456 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 91 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:33,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 219 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:58:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:58:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:58:33,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2024-10-12 15:58:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:33,458 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:58:33,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:58:33,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:58:33,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:58:33,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:58:33,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:33,666 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:33,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:58:33,862 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:58:33,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:58:33 BoogieIcfgContainer [2024-10-12 15:58:33,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:58:33,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:58:33,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:58:33,883 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:58:33,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:22" (3/4) ... [2024-10-12 15:58:33,886 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:58:33,902 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:58:33,903 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:58:33,904 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:58:33,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:58:34,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:58:34,070 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:58:34,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:58:34,071 INFO L158 Benchmark]: Toolchain (without parser) took 14115.54ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 125.1MB in the beginning and 178.3MB in the end (delta: -53.2MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,075 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:58:34,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.23ms. Allocated memory is still 159.4MB. Free memory was 125.1MB in the beginning and 95.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.83ms. Allocated memory is still 159.4MB. Free memory was 95.7MB in the beginning and 87.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,076 INFO L158 Benchmark]: Boogie Preprocessor took 153.09ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 123.3MB in the end (delta: -35.9MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,076 INFO L158 Benchmark]: RCFGBuilder took 1439.57ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 123.3MB in the beginning and 139.7MB in the end (delta: -16.5MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,076 INFO L158 Benchmark]: TraceAbstraction took 11667.77ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 139.7MB in the beginning and 189.8MB in the end (delta: -50.0MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,077 INFO L158 Benchmark]: Witness Printer took 187.57ms. Allocated memory is still 346.0MB. Free memory was 189.8MB in the beginning and 178.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 15:58:34,078 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.23ms. Allocated memory is still 159.4MB. Free memory was 125.1MB in the beginning and 95.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.83ms. Allocated memory is still 159.4MB. Free memory was 95.7MB in the beginning and 87.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.09ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 123.3MB in the end (delta: -35.9MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1439.57ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 123.3MB in the beginning and 139.7MB in the end (delta: -16.5MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11667.77ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 139.7MB in the beginning and 189.8MB in the end (delta: -50.0MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. * Witness Printer took 187.57ms. Allocated memory is still 346.0MB. Free memory was 189.8MB in the beginning and 178.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 167]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 1078 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3933 IncrementalHoareTripleChecker+Invalid, 4501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 568 mSolverCounterUnsat, 1027 mSDtfsCounter, 3933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1244 GetRequests, 1218 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1810occurred in iteration=10, InterpolantAutomatonStates: 36, 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, 11 MinimizatonAttempts, 834 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3425 NumberOfCodeBlocks, 3425 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3410 ConstructedInterpolants, 0 QuantifiedInterpolants, 13618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1666 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 2547/2831 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((a19 <= 6) && (14 == a4)) && (a12 == 0)) || (((a10 != 4) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:58:34,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE