./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1108eeb4bd20019b014e3c74d7da568cbd9d144764ba0dc8eabd0c3ee1f98907 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:20:55,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:20:55,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:20:55,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:20:55,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:20:55,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:20:55,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:20:55,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:20:55,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:20:55,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:20:55,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:20:55,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:20:55,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:20:55,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:20:55,937 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:20:55,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:20:55,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:20:55,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:20:55,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:20:55,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:20:55,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:20:55,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:20:55,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:20:55,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:20:55,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:20:55,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:20:55,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:20:55,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:20:55,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:20:55,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:20:55,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:20:55,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:20:55,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:55,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:20:55,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:20:55,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:20:55,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:20:55,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:20:55,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:20:55,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:20:55,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:20:55,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:20:55,948 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1108eeb4bd20019b014e3c74d7da568cbd9d144764ba0dc8eabd0c3ee1f98907 [2024-11-09 19:20:56,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:20:56,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:20:56,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:20:56,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:20:56,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:20:56,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label04.c [2024-11-09 19:20:57,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:20:58,136 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:20:58,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c [2024-11-09 19:20:58,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bb44610/4df39103e90c49e8aeb0cba131a3f5ce/FLAG140a6c4b6 [2024-11-09 19:20:58,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bb44610/4df39103e90c49e8aeb0cba131a3f5ce [2024-11-09 19:20:58,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:20:58,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:20:58,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:58,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:20:58,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:20:58,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:58" (1/1) ... [2024-11-09 19:20:58,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f38ac61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:58, skipping insertion in model container [2024-11-09 19:20:58,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:58" (1/1) ... [2024-11-09 19:20:58,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:20:58,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c[7746,7759] [2024-11-09 19:20:58,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:59,005 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:20:59,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c[7746,7759] [2024-11-09 19:20:59,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:59,170 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:20:59,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59 WrapperNode [2024-11-09 19:20:59,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:59,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:59,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:20:59,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:20:59,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,304 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:20:59,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:59,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:20:59,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:20:59,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:20:59,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:20:59,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:20:59,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:20:59,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:20:59,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:20:59,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:59,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:20:59,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:20:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:20:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:20:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:20:59,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:20:59,683 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:20:59,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:21:01,547 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:21:01,548 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:21:01,576 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:21:01,579 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:21:01,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:01 BoogieIcfgContainer [2024-11-09 19:21:01,580 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:21:01,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:21:01,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:21:01,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:21:01,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:20:58" (1/3) ... [2024-11-09 19:21:01,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a8097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:21:01, skipping insertion in model container [2024-11-09 19:21:01,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59" (2/3) ... [2024-11-09 19:21:01,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a8097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:21:01, skipping insertion in model container [2024-11-09 19:21:01,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:01" (3/3) ... [2024-11-09 19:21:01,590 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label04.c [2024-11-09 19:21:01,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:21:01,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:21:01,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:21:01,682 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;@5d45b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:21:01,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:21:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 19:21:01,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:01,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:01,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:01,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash -168978743, now seen corresponding path program 1 times [2024-11-09 19:21:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178149969] [2024-11-09 19:21:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:02,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178149969] [2024-11-09 19:21:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178149969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47409838] [2024-11-09 19:21:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:02,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:02,152 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:03,490 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:21:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2024-11-09 19:21:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:03,512 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:21:03,512 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:21:03,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:03,522 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 294 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:03,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:21:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:21:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:21:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:21:03,611 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 55 [2024-11-09 19:21:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:03,611 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:21:03,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:21:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 19:21:03,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:03,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:21:03,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:21:03,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -905554144, now seen corresponding path program 1 times [2024-11-09 19:21:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526416873] [2024-11-09 19:21:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526416873] [2024-11-09 19:21:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526416873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523056096] [2024-11-09 19:21:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:03,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:03,838 INFO L87 Difference]: Start difference. First operand 416 states and 840 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:04,783 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:21:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-11-09 19:21:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:04,787 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:21:04,788 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:21:04,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:04,791 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 264 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:04,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 122 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:21:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:21:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9735182849936947) internal successors, (1565), 793 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1565 transitions. [2024-11-09 19:21:04,842 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1565 transitions. Word has length 124 [2024-11-09 19:21:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:04,843 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1565 transitions. [2024-11-09 19:21:04,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1565 transitions. [2024-11-09 19:21:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 19:21:04,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:04,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:21:04,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:21:04,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:04,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash 880709084, now seen corresponding path program 1 times [2024-11-09 19:21:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499358119] [2024-11-09 19:21:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499358119] [2024-11-09 19:21:05,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499358119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:05,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806807940] [2024-11-09 19:21:05,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:05,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:05,438 INFO L87 Difference]: Start difference. First operand 794 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:07,222 INFO L93 Difference]: Finished difference Result 2520 states and 4990 transitions. [2024-11-09 19:21:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2024-11-09 19:21:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:07,232 INFO L225 Difference]: With dead ends: 2520 [2024-11-09 19:21:07,233 INFO L226 Difference]: Without dead ends: 1728 [2024-11-09 19:21:07,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:21:07,239 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 845 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:07,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 225 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:21:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-11-09 19:21:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1724. [2024-11-09 19:21:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.8467788740568776) internal successors, (3182), 1723 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3182 transitions. [2024-11-09 19:21:07,289 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3182 transitions. Word has length 125 [2024-11-09 19:21:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:07,290 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 3182 transitions. [2024-11-09 19:21:07,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3182 transitions. [2024-11-09 19:21:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 19:21:07,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:07,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:07,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:21:07,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:07,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1236921853, now seen corresponding path program 1 times [2024-11-09 19:21:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:07,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058986745] [2024-11-09 19:21:07,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:07,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:07,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:07,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058986745] [2024-11-09 19:21:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058986745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:07,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:07,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:07,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609854879] [2024-11-09 19:21:07,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:07,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:07,540 INFO L87 Difference]: Start difference. First operand 1724 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:08,456 INFO L93 Difference]: Finished difference Result 4014 states and 7507 transitions. [2024-11-09 19:21:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 183 [2024-11-09 19:21:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:08,467 INFO L225 Difference]: With dead ends: 4014 [2024-11-09 19:21:08,467 INFO L226 Difference]: Without dead ends: 2477 [2024-11-09 19:21:08,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:08,471 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 271 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:08,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 460 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2024-11-09 19:21:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2282. [2024-11-09 19:21:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 1.8382288469969312) internal successors, (4193), 2281 states have internal predecessors, (4193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 4193 transitions. [2024-11-09 19:21:08,515 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 4193 transitions. Word has length 183 [2024-11-09 19:21:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 4193 transitions. [2024-11-09 19:21:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 4193 transitions. [2024-11-09 19:21:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 19:21:08,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:08,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:08,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:21:08,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 813558145, now seen corresponding path program 1 times [2024-11-09 19:21:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336492726] [2024-11-09 19:21:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:21:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336492726] [2024-11-09 19:21:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336492726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780217405] [2024-11-09 19:21:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:08,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:08,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:08,843 INFO L87 Difference]: Start difference. First operand 2282 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:09,735 INFO L93 Difference]: Finished difference Result 5674 states and 10542 transitions. [2024-11-09 19:21:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 238 [2024-11-09 19:21:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:09,750 INFO L225 Difference]: With dead ends: 5674 [2024-11-09 19:21:09,750 INFO L226 Difference]: Without dead ends: 3394 [2024-11-09 19:21:09,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:09,755 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 305 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:09,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 135 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2024-11-09 19:21:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3394. [2024-11-09 19:21:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3393 states have (on average 1.8323017978190392) internal successors, (6217), 3393 states have internal predecessors, (6217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 6217 transitions. [2024-11-09 19:21:09,825 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 6217 transitions. Word has length 238 [2024-11-09 19:21:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:09,827 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 6217 transitions. [2024-11-09 19:21:09,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 6217 transitions. [2024-11-09 19:21:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-09 19:21:09,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:09,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:09,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:21:09,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:09,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash 876971101, now seen corresponding path program 1 times [2024-11-09 19:21:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:09,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969937314] [2024-11-09 19:21:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:09,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 19:21:10,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969937314] [2024-11-09 19:21:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969937314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:10,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335664588] [2024-11-09 19:21:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:10,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:10,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:10,134 INFO L87 Difference]: Start difference. First operand 3394 states and 6217 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:11,072 INFO L93 Difference]: Finished difference Result 7541 states and 13839 transitions. [2024-11-09 19:21:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 259 [2024-11-09 19:21:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:11,093 INFO L225 Difference]: With dead ends: 7541 [2024-11-09 19:21:11,094 INFO L226 Difference]: Without dead ends: 4149 [2024-11-09 19:21:11,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:11,101 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 268 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:11,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 193 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2024-11-09 19:21:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3949. [2024-11-09 19:21:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 3948 states have (on average 1.8361195542046607) internal successors, (7249), 3948 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 7249 transitions. [2024-11-09 19:21:11,173 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 7249 transitions. Word has length 259 [2024-11-09 19:21:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:11,173 INFO L471 AbstractCegarLoop]: Abstraction has 3949 states and 7249 transitions. [2024-11-09 19:21:11,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 7249 transitions. [2024-11-09 19:21:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-09 19:21:11,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:11,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:11,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:21:11,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash -833217841, now seen corresponding path program 1 times [2024-11-09 19:21:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791183062] [2024-11-09 19:21:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 57 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791183062] [2024-11-09 19:21:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791183062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210646317] [2024-11-09 19:21:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:11,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:21:11,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:21:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:12,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:12,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:12,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210646317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 19:21:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963484259] [2024-11-09 19:21:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:21:12,152 INFO L87 Difference]: Start difference. First operand 3949 states and 7249 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:13,160 INFO L93 Difference]: Finished difference Result 8641 states and 15970 transitions. [2024-11-09 19:21:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:13,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 276 [2024-11-09 19:21:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:13,177 INFO L225 Difference]: With dead ends: 8641 [2024-11-09 19:21:13,177 INFO L226 Difference]: Without dead ends: 4694 [2024-11-09 19:21:13,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:21:13,183 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 267 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:13,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 502 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:21:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2024-11-09 19:21:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4503. [2024-11-09 19:21:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 4502 states have (on average 1.8322967569968902) internal successors, (8249), 4502 states have internal predecessors, (8249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 8249 transitions. [2024-11-09 19:21:13,258 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 8249 transitions. Word has length 276 [2024-11-09 19:21:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 8249 transitions. [2024-11-09 19:21:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 8249 transitions. [2024-11-09 19:21:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-09 19:21:13,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:13,264 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:13,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 19:21:13,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:13,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:13,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1951020265, now seen corresponding path program 1 times [2024-11-09 19:21:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581414559] [2024-11-09 19:21:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 19:21:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581414559] [2024-11-09 19:21:13,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581414559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:13,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336402692] [2024-11-09 19:21:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:13,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:13,733 INFO L87 Difference]: Start difference. First operand 4503 states and 8249 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:14,739 INFO L93 Difference]: Finished difference Result 11051 states and 20325 transitions. [2024-11-09 19:21:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 282 [2024-11-09 19:21:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:14,765 INFO L225 Difference]: With dead ends: 11051 [2024-11-09 19:21:14,765 INFO L226 Difference]: Without dead ends: 6550 [2024-11-09 19:21:14,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:14,772 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 272 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:14,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 513 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2024-11-09 19:21:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6175. [2024-11-09 19:21:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6174 states have (on average 1.8206997084548104) internal successors, (11241), 6174 states have internal predecessors, (11241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 11241 transitions. [2024-11-09 19:21:14,890 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 11241 transitions. Word has length 282 [2024-11-09 19:21:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:14,891 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 11241 transitions. [2024-11-09 19:21:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 11241 transitions. [2024-11-09 19:21:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-09 19:21:14,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:14,898 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:14,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:21:14,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash 18935370, now seen corresponding path program 1 times [2024-11-09 19:21:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568489951] [2024-11-09 19:21:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568489951] [2024-11-09 19:21:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568489951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119864141] [2024-11-09 19:21:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:15,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:15,203 INFO L87 Difference]: Start difference. First operand 6175 states and 11241 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:16,652 INFO L93 Difference]: Finished difference Result 17560 states and 32317 transitions. [2024-11-09 19:21:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 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 317 [2024-11-09 19:21:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:16,677 INFO L225 Difference]: With dead ends: 17560 [2024-11-09 19:21:16,677 INFO L226 Difference]: Without dead ends: 11387 [2024-11-09 19:21:16,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:16,687 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 494 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:16,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 95 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:21:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2024-11-09 19:21:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11383. [2024-11-09 19:21:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11383 states, 11382 states have (on average 1.8266561237040941) internal successors, (20791), 11382 states have internal predecessors, (20791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 20791 transitions. [2024-11-09 19:21:16,858 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 20791 transitions. Word has length 317 [2024-11-09 19:21:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:16,858 INFO L471 AbstractCegarLoop]: Abstraction has 11383 states and 20791 transitions. [2024-11-09 19:21:16,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 20791 transitions. [2024-11-09 19:21:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-09 19:21:16,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:16,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:16,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:21:16,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1331249410, now seen corresponding path program 1 times [2024-11-09 19:21:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:16,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602459365] [2024-11-09 19:21:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:21:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602459365] [2024-11-09 19:21:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602459365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:17,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481002641] [2024-11-09 19:21:17,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:17,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:17,198 INFO L87 Difference]: Start difference. First operand 11383 states and 20791 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:18,103 INFO L93 Difference]: Finished difference Result 25535 states and 46786 transitions. [2024-11-09 19:21:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 318 [2024-11-09 19:21:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:18,132 INFO L225 Difference]: With dead ends: 25535 [2024-11-09 19:21:18,132 INFO L226 Difference]: Without dead ends: 14525 [2024-11-09 19:21:18,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:18,146 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 285 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:18,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 473 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2024-11-09 19:21:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 13969. [2024-11-09 19:21:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13969 states, 13968 states have (on average 1.8069158075601375) internal successors, (25239), 13968 states have internal predecessors, (25239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13969 states to 13969 states and 25239 transitions. [2024-11-09 19:21:18,415 INFO L78 Accepts]: Start accepts. Automaton has 13969 states and 25239 transitions. Word has length 318 [2024-11-09 19:21:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:18,416 INFO L471 AbstractCegarLoop]: Abstraction has 13969 states and 25239 transitions. [2024-11-09 19:21:18,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13969 states and 25239 transitions. [2024-11-09 19:21:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-09 19:21:18,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:18,427 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-09 19:21:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:21:18,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:18,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash -260793976, now seen corresponding path program 1 times [2024-11-09 19:21:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190107453] [2024-11-09 19:21:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 19:21:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190107453] [2024-11-09 19:21:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190107453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169601539] [2024-11-09 19:21:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:18,634 INFO L87 Difference]: Start difference. First operand 13969 states and 25239 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:19,492 INFO L93 Difference]: Finished difference Result 26446 states and 47888 transitions. [2024-11-09 19:21:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 337 [2024-11-09 19:21:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:19,521 INFO L225 Difference]: With dead ends: 26446 [2024-11-09 19:21:19,521 INFO L226 Difference]: Without dead ends: 13595 [2024-11-09 19:21:19,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:19,532 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 283 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:19,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 153 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13595 states. [2024-11-09 19:21:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13595 to 12111. [2024-11-09 19:21:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12111 states, 12110 states have (on average 1.7718414533443436) internal successors, (21457), 12110 states have internal predecessors, (21457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12111 states to 12111 states and 21457 transitions. [2024-11-09 19:21:19,682 INFO L78 Accepts]: Start accepts. Automaton has 12111 states and 21457 transitions. Word has length 337 [2024-11-09 19:21:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 12111 states and 21457 transitions. [2024-11-09 19:21:19,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 12111 states and 21457 transitions. [2024-11-09 19:21:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-09 19:21:19,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:19,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:19,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:21:19,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:19,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash -63892910, now seen corresponding path program 1 times [2024-11-09 19:21:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:19,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149258042] [2024-11-09 19:21:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:19,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:21:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149258042] [2024-11-09 19:21:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149258042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:19,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:19,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231192957] [2024-11-09 19:21:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:19,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:19,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:19,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:19,939 INFO L87 Difference]: Start difference. First operand 12111 states and 21457 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:20,401 INFO L93 Difference]: Finished difference Result 22914 states and 40610 transitions. [2024-11-09 19:21:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 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 339 [2024-11-09 19:21:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:20,423 INFO L225 Difference]: With dead ends: 22914 [2024-11-09 19:21:20,424 INFO L226 Difference]: Without dead ends: 12104 [2024-11-09 19:21:20,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:20,436 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 309 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:20,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 42 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:21:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12104 states. [2024-11-09 19:21:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12104 to 12102. [2024-11-09 19:21:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12102 states, 12101 states have (on average 1.7716717626642426) internal successors, (21439), 12101 states have internal predecessors, (21439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12102 states to 12102 states and 21439 transitions. [2024-11-09 19:21:20,584 INFO L78 Accepts]: Start accepts. Automaton has 12102 states and 21439 transitions. Word has length 339 [2024-11-09 19:21:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:20,585 INFO L471 AbstractCegarLoop]: Abstraction has 12102 states and 21439 transitions. [2024-11-09 19:21:20,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 12102 states and 21439 transitions. [2024-11-09 19:21:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-09 19:21:20,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:20,594 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:20,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:21:20,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:20,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash -841581406, now seen corresponding path program 1 times [2024-11-09 19:21:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365108942] [2024-11-09 19:21:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 29 proven. 74 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 19:21:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365108942] [2024-11-09 19:21:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365108942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972291245] [2024-11-09 19:21:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:21,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:21,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:21,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:21:21,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:21:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:21,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:21,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 19:21:21,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972291245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:21:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501668619] [2024-11-09 19:21:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:21,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:21,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:21,477 INFO L87 Difference]: Start difference. First operand 12102 states and 21439 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:22,417 INFO L93 Difference]: Finished difference Result 25864 states and 46014 transitions. [2024-11-09 19:21:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 340 [2024-11-09 19:21:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:22,441 INFO L225 Difference]: With dead ends: 25864 [2024-11-09 19:21:22,442 INFO L226 Difference]: Without dead ends: 14134 [2024-11-09 19:21:22,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:22,453 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 261 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:22,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 489 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2024-11-09 19:21:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 13020. [2024-11-09 19:21:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13020 states, 13019 states have (on average 1.7565097165680927) internal successors, (22868), 13019 states have internal predecessors, (22868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 22868 transitions. [2024-11-09 19:21:22,681 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 22868 transitions. Word has length 340 [2024-11-09 19:21:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:22,682 INFO L471 AbstractCegarLoop]: Abstraction has 13020 states and 22868 transitions. [2024-11-09 19:21:22,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 22868 transitions. [2024-11-09 19:21:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-09 19:21:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:22,696 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:22,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:21:22,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 19:21:22,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:22,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1731334874, now seen corresponding path program 1 times [2024-11-09 19:21:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470955743] [2024-11-09 19:21:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-09 19:21:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470955743] [2024-11-09 19:21:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470955743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:23,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:23,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464146175] [2024-11-09 19:21:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:23,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:23,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:23,203 INFO L87 Difference]: Start difference. First operand 13020 states and 22868 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:24,204 INFO L93 Difference]: Finished difference Result 25855 states and 45368 transitions. [2024-11-09 19:21:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 398 [2024-11-09 19:21:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:24,206 INFO L225 Difference]: With dead ends: 25855 [2024-11-09 19:21:24,206 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:21:24,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:24,217 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 261 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:24,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 463 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:21:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:21:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:21:24,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 398 [2024-11-09 19:21:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:21:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:21:24,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:21:24,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:21:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:21:24,226 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:24,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:21:25,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:21:25,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:21:25 BoogieIcfgContainer [2024-11-09 19:21:25,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:21:25,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:21:25,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:21:25,173 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:21:25,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:01" (3/4) ... [2024-11-09 19:21:25,175 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:21:25,202 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:21:25,204 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:21:25,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:21:25,207 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:21:25,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:21:25,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:21:25,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:21:25,393 INFO L158 Benchmark]: Toolchain (without parser) took 26951.08ms. Allocated memory was 157.3MB in the beginning and 817.9MB in the end (delta: 660.6MB). Free memory was 131.0MB in the beginning and 342.9MB in the end (delta: -211.9MB). Peak memory consumption was 448.6MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,393 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:21:25,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.54ms. Allocated memory is still 157.3MB. Free memory was 130.5MB in the beginning and 83.2MB in the end (delta: 47.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.72ms. Allocated memory is still 157.3MB. Free memory was 83.2MB in the beginning and 65.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,394 INFO L158 Benchmark]: Boogie Preprocessor took 212.12ms. Allocated memory is still 157.3MB. Free memory was 65.8MB in the beginning and 115.0MB in the end (delta: -49.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,395 INFO L158 Benchmark]: IcfgBuilder took 2060.99ms. Allocated memory was 157.3MB in the beginning and 228.6MB in the end (delta: 71.3MB). Free memory was 115.0MB in the beginning and 102.1MB in the end (delta: 12.9MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,395 INFO L158 Benchmark]: TraceAbstraction took 23589.89ms. Allocated memory was 228.6MB in the beginning and 817.9MB in the end (delta: 589.3MB). Free memory was 101.1MB in the beginning and 363.9MB in the end (delta: -262.9MB). Peak memory consumption was 459.6MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,395 INFO L158 Benchmark]: Witness Printer took 220.12ms. Allocated memory is still 817.9MB. Free memory was 362.9MB in the beginning and 342.9MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 19:21:25,397 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.28ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.54ms. Allocated memory is still 157.3MB. Free memory was 130.5MB in the beginning and 83.2MB in the end (delta: 47.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.72ms. Allocated memory is still 157.3MB. Free memory was 83.2MB in the beginning and 65.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 212.12ms. Allocated memory is still 157.3MB. Free memory was 65.8MB in the beginning and 115.0MB in the end (delta: -49.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * IcfgBuilder took 2060.99ms. Allocated memory was 157.3MB in the beginning and 228.6MB in the end (delta: 71.3MB). Free memory was 115.0MB in the beginning and 102.1MB in the end (delta: 12.9MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23589.89ms. Allocated memory was 228.6MB in the beginning and 817.9MB in the end (delta: 589.3MB). Free memory was 101.1MB in the beginning and 363.9MB in the end (delta: -262.9MB). Peak memory consumption was 459.6MB. Max. memory is 16.1GB. * Witness Printer took 220.12ms. Allocated memory is still 817.9MB. Free memory was 362.9MB in the beginning and 342.9MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. 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: 175]: 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, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4679 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4679 mSDsluCounter, 4092 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 1511 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12278 IncrementalHoareTripleChecker+Invalid, 13789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1511 mSolverCounterUnsat, 3726 mSDtfsCounter, 12278 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13969occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 4136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4207 NumberOfCodeBlocks, 4207 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4191 ConstructedInterpolants, 0 QuantifiedInterpolants, 14159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 833 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 2921/3117 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: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:21:25,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE