./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_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label36.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7c554a2a59989d7418fb8bbc352053403850f90f025458cceb44c8da15af850b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:16:43,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:16:43,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:16:43,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:16:43,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:16:43,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:16:43,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:16:43,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:16:43,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:16:43,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:16:43,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:16:43,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:16:43,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:16:43,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:16:43,347 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:16:43,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:16:43,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:16:43,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:16:43,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:16:43,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:16:43,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:16:43,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:16:43,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:16:43,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:16:43,350 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:16:43,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:16:43,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:16:43,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:16:43,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:16:43,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:16:43,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:16:43,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:16:43,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:43,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:16:43,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:16:43,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:16:43,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:16:43,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:16:43,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:16:43,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:16:43,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:16:43,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:16:43,358 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-clean/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-clean/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 -> 7c554a2a59989d7418fb8bbc352053403850f90f025458cceb44c8da15af850b [2024-10-10 23:16:43,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:16:43,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:16:43,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:16:43,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:16:43,643 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:16:43,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label36.c [2024-10-10 23:16:45,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:16:45,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:16:45,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label36.c [2024-10-10 23:16:45,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c50cd7155/29a19da916084511b05a6f63ac21361b/FLAGde063b3d9 [2024-10-10 23:16:45,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c50cd7155/29a19da916084511b05a6f63ac21361b [2024-10-10 23:16:45,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:16:45,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:16:45,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:45,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:16:45,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:16:45,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:45" (1/1) ... [2024-10-10 23:16:45,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dddb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:45, skipping insertion in model container [2024-10-10 23:16:45,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:45" (1/1) ... [2024-10-10 23:16:45,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:16:45,819 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_label36.c[4555,4568] [2024-10-10 23:16:45,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:45,959 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:16:45,979 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_label36.c[4555,4568] [2024-10-10 23:16:46,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:46,065 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:16:46,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46 WrapperNode [2024-10-10 23:16:46,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:46,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:46,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:16:46,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:16:46,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,139 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:16:46,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:46,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:16:46,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:16:46,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:16:46,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,198 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-10 23:16:46,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:16:46,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:16:46,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:16:46,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:16:46,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (1/1) ... [2024-10-10 23:16:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:46,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:46,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:16:46,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:16:46,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:16:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:16:46,413 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:16:46,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:16:47,583 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:16:47,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:16:47,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:16:47,644 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:16:47,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:47 BoogieIcfgContainer [2024-10-10 23:16:47,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:16:47,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:16:47,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:16:47,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:16:47,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:16:45" (1/3) ... [2024-10-10 23:16:47,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d01c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:47, skipping insertion in model container [2024-10-10 23:16:47,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:46" (2/3) ... [2024-10-10 23:16:47,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d01c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:47, skipping insertion in model container [2024-10-10 23:16:47,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:47" (3/3) ... [2024-10-10 23:16:47,655 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label36.c [2024-10-10 23:16:47,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:16:47,673 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:16:47,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:16:47,754 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;@29dfc44b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:16:47,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:16:47,759 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-10 23:16:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 23:16:47,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:47,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:47,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:47,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash 922312460, now seen corresponding path program 1 times [2024-10-10 23:16:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846858950] [2024-10-10 23:16:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:47,997 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-10 23:16:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846858950] [2024-10-10 23:16:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846858950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:47,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:47,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792291334] [2024-10-10 23:16:48,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:48,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:16:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:48,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:16:48,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:48,040 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:48,085 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:16:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:16:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-10 23:16:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:48,098 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:16:48,098 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:16:48,102 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-10 23:16:48,106 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-10 23:16:48,108 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-10 23:16:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:16:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:16:48,155 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-10 23:16:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:16:48,159 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 38 [2024-10-10 23:16:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:48,159 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:16:48,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:16:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 23:16:48,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:48,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:16:48,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:48,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2060698202, now seen corresponding path program 1 times [2024-10-10 23:16:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213403957] [2024-10-10 23:16:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:48,410 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-10 23:16:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:48,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213403957] [2024-10-10 23:16:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213403957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218353858] [2024-10-10 23:16:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:48,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:48,415 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:49,098 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-10 23:16:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-10 23:16:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:49,101 INFO L225 Difference]: With dead ends: 422 [2024-10-10 23:16:49,103 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:16:49,104 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-10 23:16:49,106 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 108 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 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.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:49,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:16:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:16:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:16:49,131 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-10 23:16:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-10 23:16:49,134 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 38 [2024-10-10 23:16:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:49,134 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-10 23:16:49,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-10 23:16:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:16:49,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:49,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:16:49,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:16:49,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:49,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -960959559, now seen corresponding path program 1 times [2024-10-10 23:16:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028155445] [2024-10-10 23:16:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028155445] [2024-10-10 23:16:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028155445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035296084] [2024-10-10 23:16:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:49,568 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10 23:16:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:50,094 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-10 23:16:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:50,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2024-10-10 23:16:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:50,098 INFO L225 Difference]: With dead ends: 700 [2024-10-10 23:16:50,099 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:16:50,100 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-10 23:16:50,101 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 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-10 23:16:50,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 19 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:16:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:16:50,119 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-10 23:16:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-10 23:16:50,121 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 104 [2024-10-10 23:16:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:50,121 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-10 23:16:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10 23:16:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-10 23:16:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-10 23:16:50,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:50,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:16:50,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:16:50,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:50,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1956320407, now seen corresponding path program 1 times [2024-10-10 23:16:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:50,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719585179] [2024-10-10 23:16:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719585179] [2024-10-10 23:16:50,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719585179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:50,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:50,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915241200] [2024-10-10 23:16:50,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:50,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:50,364 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:50,776 INFO L93 Difference]: Finished difference Result 978 states and 1318 transitions. [2024-10-10 23:16:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-10-10 23:16:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:50,779 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:16:50,779 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:16:50,780 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-10 23:16:50,781 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-10 23:16:50,781 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-10 23:16:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:16:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:16:50,802 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-10 23:16:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-10 23:16:50,803 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 121 [2024-10-10 23:16:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:50,804 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-10 23:16:50,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-10 23:16:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-10 23:16:50,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:50,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:16:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:16:50,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -218352341, now seen corresponding path program 1 times [2024-10-10 23:16:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649247011] [2024-10-10 23:16:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649247011] [2024-10-10 23:16:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649247011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:50,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:50,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396275618] [2024-10-10 23:16:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:50,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:50,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:50,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:50,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:50,932 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-10 23:16:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:51,374 INFO L93 Difference]: Finished difference Result 1256 states and 1671 transitions. [2024-10-10 23:16:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:51,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2024-10-10 23:16:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:51,381 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:16:51,381 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:16:51,382 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-10 23:16:51,383 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:51,383 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.4s Time] [2024-10-10 23:16:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:16:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:16:51,400 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-10 23:16:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1027 transitions. [2024-10-10 23:16:51,402 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1027 transitions. Word has length 129 [2024-10-10 23:16:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:51,403 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1027 transitions. [2024-10-10 23:16:51,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-10 23:16:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1027 transitions. [2024-10-10 23:16:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-10 23:16:51,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:51,409 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, 2, 2, 2, 2, 2, 2, 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-10 23:16:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:16:51,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 430417828, now seen corresponding path program 1 times [2024-10-10 23:16:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207496431] [2024-10-10 23:16:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 23:16:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207496431] [2024-10-10 23:16:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207496431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618110279] [2024-10-10 23:16:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:51,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:51,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:51,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:51,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:16:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:51,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:51,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-10 23:16:52,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618110279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:52,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:16:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405962478] [2024-10-10 23:16:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:52,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:16:52,195 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-10 23:16:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:52,651 INFO L93 Difference]: Finished difference Result 1256 states and 1546 transitions. [2024-10-10 23:16:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:52,652 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 187 [2024-10-10 23:16:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:52,657 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:16:52,657 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:16:52,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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-10 23:16:52,660 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-10 23:16:52,662 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-10 23:16:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:16:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 976. [2024-10-10 23:16:52,682 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-10 23:16:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1216 transitions. [2024-10-10 23:16:52,685 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1216 transitions. Word has length 187 [2024-10-10 23:16:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:52,686 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1216 transitions. [2024-10-10 23:16:52,686 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-10 23:16:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1216 transitions. [2024-10-10 23:16:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-10 23:16:52,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:52,689 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:52,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:16:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:52,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -964801077, now seen corresponding path program 1 times [2024-10-10 23:16:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3177805] [2024-10-10 23:16:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:53,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3177805] [2024-10-10 23:16:53,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3177805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:53,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:53,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528092618] [2024-10-10 23:16:53,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:53,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:53,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:53,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:53,191 INFO L87 Difference]: Start difference. First operand 976 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-10 23:16:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:53,630 INFO L93 Difference]: Finished difference Result 1951 states and 2466 transitions. [2024-10-10 23:16:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2024-10-10 23:16:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:53,635 INFO L225 Difference]: With dead ends: 1951 [2024-10-10 23:16:53,636 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:16:53,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:53,638 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-10 23:16:53,638 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-10 23:16:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:16:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-10 23:16:53,654 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-10 23:16:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1365 transitions. [2024-10-10 23:16:53,657 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1365 transitions. Word has length 241 [2024-10-10 23:16:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:53,657 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1365 transitions. [2024-10-10 23:16:53,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-10 23:16:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1365 transitions. [2024-10-10 23:16:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-10 23:16:53,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:53,661 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:16:53,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:16:53,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:53,663 INFO L85 PathProgramCache]: Analyzing trace with hash -18753343, now seen corresponding path program 1 times [2024-10-10 23:16:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:53,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657269177] [2024-10-10 23:16:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657269177] [2024-10-10 23:16:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657269177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:16:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653951171] [2024-10-10 23:16:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:54,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:16:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:16:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:54,100 INFO L87 Difference]: Start difference. First operand 1115 states and 1365 transitions. Second operand has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 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-10 23:16:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:54,623 INFO L93 Difference]: Finished difference Result 2145 states and 2640 transitions. [2024-10-10 23:16:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:16:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 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 250 [2024-10-10 23:16:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:54,627 INFO L225 Difference]: With dead ends: 2145 [2024-10-10 23:16:54,627 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:16:54,628 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-10 23:16:54,629 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:54,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 21 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:16:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-10 23:16:54,647 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-10 23:16:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1358 transitions. [2024-10-10 23:16:54,651 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1358 transitions. Word has length 250 [2024-10-10 23:16:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:54,652 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1358 transitions. [2024-10-10 23:16:54,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 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-10 23:16:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1358 transitions. [2024-10-10 23:16:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-10 23:16:54,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:54,656 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:16:54,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:16:54,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:54,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash -46412953, now seen corresponding path program 1 times [2024-10-10 23:16:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535579158] [2024-10-10 23:16:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 41 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:16:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:55,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535579158] [2024-10-10 23:16:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535579158] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147292027] [2024-10-10 23:16:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:55,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:55,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:16:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:55,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:55,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:16:55,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147292027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:16:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951604253] [2024-10-10 23:16:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:55,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:55,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:55,273 INFO L87 Difference]: Start difference. First operand 1115 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:55,740 INFO L93 Difference]: Finished difference Result 1673 states and 2023 transitions. [2024-10-10 23:16:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2024-10-10 23:16:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:55,747 INFO L225 Difference]: With dead ends: 1673 [2024-10-10 23:16:55,748 INFO L226 Difference]: Without dead ends: 1671 [2024-10-10 23:16:55,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:55,749 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 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-10 23:16:55,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 9 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-10 23:16:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1115. [2024-10-10 23:16:55,772 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-10 23:16:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1358 transitions. [2024-10-10 23:16:55,775 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1358 transitions. Word has length 286 [2024-10-10 23:16:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:55,775 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1358 transitions. [2024-10-10 23:16:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1358 transitions. [2024-10-10 23:16:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-10 23:16:55,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:55,780 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:55,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:16:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:55,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2097891751, now seen corresponding path program 1 times [2024-10-10 23:16:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378852276] [2024-10-10 23:16:55,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 310 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378852276] [2024-10-10 23:16:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378852276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813343452] [2024-10-10 23:16:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:56,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:56,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:56,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:16:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:56,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:56,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:16:56,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813343452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:56,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:56,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:16:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137990741] [2024-10-10 23:16:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:56,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:56,844 INFO L87 Difference]: Start difference. First operand 1115 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-10 23:16:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:57,302 INFO L93 Difference]: Finished difference Result 2785 states and 3438 transitions. [2024-10-10 23:16:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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 338 [2024-10-10 23:16:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:57,311 INFO L225 Difference]: With dead ends: 2785 [2024-10-10 23:16:57,311 INFO L226 Difference]: Without dead ends: 1810 [2024-10-10 23:16:57,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 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-10 23:16:57,314 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:57,314 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.4s Time] [2024-10-10 23:16:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-10 23:16:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-10-10 23:16:57,342 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-10 23:16:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2138 transitions. [2024-10-10 23:16:57,347 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2138 transitions. Word has length 338 [2024-10-10 23:16:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2138 transitions. [2024-10-10 23:16:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-10 23:16:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2138 transitions. [2024-10-10 23:16:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:16:57,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:57,354 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:57,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:16:57,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:57,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:57,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -389693887, now seen corresponding path program 1 times [2024-10-10 23:16:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:57,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888787098] [2024-10-10 23:16:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 92 proven. 18 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:16:57,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:57,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888787098] [2024-10-10 23:16:57,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888787098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:57,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206220933] [2024-10-10 23:16:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:57,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:57,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:58,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:58,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:16:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:58,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:58,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:16:58,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:58,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206220933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:16:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087354163] [2024-10-10 23:16:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:58,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:58,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:58,205 INFO L87 Difference]: Start difference. First operand 1810 states and 2138 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-10 23:16:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:58,598 INFO L93 Difference]: Finished difference Result 3756 states and 4457 transitions. [2024-10-10 23:16:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 351 [2024-10-10 23:16:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:58,599 INFO L225 Difference]: With dead ends: 3756 [2024-10-10 23:16:58,599 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:16:58,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:58,603 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:58,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 219 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:16:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:16:58,604 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-10 23:16:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:16:58,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 351 [2024-10-10 23:16:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:58,605 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:16:58,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-10 23:16:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:16:58,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:16:58,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:16:58,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:16:58,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:16:58,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:58,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:16:58,997 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:16:59,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:16:59 BoogieIcfgContainer [2024-10-10 23:16:59,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:16:59,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:16:59,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:16:59,022 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:16:59,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:47" (3/4) ... [2024-10-10 23:16:59,024 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:16:59,043 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:16:59,044 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:16:59,044 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:16:59,045 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:16:59,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:16:59,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:16:59,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:16:59,191 INFO L158 Benchmark]: Toolchain (without parser) took 13736.47ms. Allocated memory was 169.9MB in the beginning and 352.3MB in the end (delta: 182.5MB). Free memory was 107.8MB in the beginning and 253.4MB in the end (delta: -145.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-10-10 23:16:59,191 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:16:59,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.76ms. Allocated memory is still 169.9MB. Free memory was 107.8MB in the beginning and 119.6MB in the end (delta: -11.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:16:59,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.50ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 111.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:16:59,192 INFO L158 Benchmark]: Boogie Preprocessor took 121.63ms. Allocated memory is still 169.9MB. Free memory was 111.2MB in the beginning and 100.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:16:59,193 INFO L158 Benchmark]: RCFGBuilder took 1381.37ms. Allocated memory was 169.9MB in the beginning and 243.3MB in the end (delta: 73.4MB). Free memory was 100.7MB in the beginning and 154.9MB in the end (delta: -54.1MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2024-10-10 23:16:59,193 INFO L158 Benchmark]: TraceAbstraction took 11373.92ms. Allocated memory was 243.3MB in the beginning and 352.3MB in the end (delta: 109.1MB). Free memory was 154.9MB in the beginning and 264.9MB in the end (delta: -110.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:16:59,193 INFO L158 Benchmark]: Witness Printer took 169.07ms. Allocated memory is still 352.3MB. Free memory was 264.9MB in the beginning and 253.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:16:59,195 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.17ms. Allocated memory is still 92.3MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.76ms. Allocated memory is still 169.9MB. Free memory was 107.8MB in the beginning and 119.6MB in the end (delta: -11.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.50ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 111.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.63ms. Allocated memory is still 169.9MB. Free memory was 111.2MB in the beginning and 100.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1381.37ms. Allocated memory was 169.9MB in the beginning and 243.3MB in the end (delta: 73.4MB). Free memory was 100.7MB in the beginning and 154.9MB in the end (delta: -54.1MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11373.92ms. Allocated memory was 243.3MB in the beginning and 352.3MB in the end (delta: 109.1MB). Free memory was 154.9MB in the beginning and 264.9MB in the end (delta: -110.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 169.07ms. Allocated memory is still 352.3MB. Free memory was 264.9MB in the beginning and 253.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 131]: 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.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 1075 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3903 IncrementalHoareTripleChecker+Invalid, 4471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 568 mSolverCounterUnsat, 1027 mSDtfsCounter, 3903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1198 GetRequests, 1170 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 834 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3245 NumberOfCodeBlocks, 3245 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3230 ConstructedInterpolants, 0 QuantifiedInterpolants, 13494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1622 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 2362/2507 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-10 23:16:59,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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