./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test23-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test23-1.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 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:44:16,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:44:16,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:44:16,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:44:16,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:44:16,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:44:16,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:44:16,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:44:16,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:44:16,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:44:16,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:44:16,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:44:16,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:44:16,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:44:16,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:44:16,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:44:16,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:44:16,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:44:16,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:44:16,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:44:16,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:44:16,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:44:16,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:44:16,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:44:16,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:44:16,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:44:16,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:44:16,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:44:16,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:44:16,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:44:16,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:44:16,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:44:16,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:16,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:44:16,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:44:16,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:44:16,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:44:16,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:44:16,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:44:16,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:44:16,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:44:16,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:44:16,418 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 -> 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e [2024-11-22 00:44:16,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:44:16,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:44:16,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:44:16,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:44:16,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:44:16,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-1.c [2024-11-22 00:44:18,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:44:18,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:44:18,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c [2024-11-22 00:44:18,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73076b117/300bba7d718c469293b8acdc4bea3c8f/FLAG705158e98 [2024-11-22 00:44:18,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73076b117/300bba7d718c469293b8acdc4bea3c8f [2024-11-22 00:44:18,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:44:18,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:44:18,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:18,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:44:18,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:44:18,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:18" (1/1) ... [2024-11-22 00:44:18,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4804dcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:18, skipping insertion in model container [2024-11-22 00:44:18,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:18" (1/1) ... [2024-11-22 00:44:18,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:44:19,036 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/ldv-regression/test23-1.c[1075,1088] [2024-11-22 00:44:19,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:19,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:44:19,081 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/ldv-regression/test23-1.c[1075,1088] [2024-11-22 00:44:19,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:19,112 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:44:19,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19 WrapperNode [2024-11-22 00:44:19,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:19,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:19,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:44:19,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:44:19,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,167 INFO L138 Inliner]: procedures = 16, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2024-11-22 00:44:19,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:19,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:44:19,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:44:19,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:44:19,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,199 INFO L175 MemorySlicer]: Split 46 memory accesses to 2 slices as follows [2, 44]. 96 percent of accesses are in the largest equivalence class. The 38 initializations are split as follows [2, 36]. The 5 writes are split as follows [0, 5]. [2024-11-22 00:44:19,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:44:19,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:44:19,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:44:19,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:44:19,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (1/1) ... [2024-11-22 00:44:19,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:19,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:19,284 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-22 00:44:19,291 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-22 00:44:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:44:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:44:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:44:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:44:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:44:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-11-22 00:44:19,342 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-11-22 00:44:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:44:19,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:44:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:44:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:44:19,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:44:19,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:44:19,644 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-22 00:44:19,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:44:19,662 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:44:19,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 00:44:19,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:19 BoogieIcfgContainer [2024-11-22 00:44:19,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:44:19,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:44:19,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:44:19,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:44:19,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:44:18" (1/3) ... [2024-11-22 00:44:19,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374546c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:19, skipping insertion in model container [2024-11-22 00:44:19,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:19" (2/3) ... [2024-11-22 00:44:19,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374546c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:19, skipping insertion in model container [2024-11-22 00:44:19,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:19" (3/3) ... [2024-11-22 00:44:19,675 INFO L112 eAbstractionObserver]: Analyzing ICFG test23-1.c [2024-11-22 00:44:19,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:44:19,691 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:44:19,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:44:19,743 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;@7c6304c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:44:19,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:44:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:44:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 00:44:19,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:19,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:19,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1478003781, now seen corresponding path program 1 times [2024-11-22 00:44:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597524395] [2024-11-22 00:44:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:20,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597524395] [2024-11-22 00:44:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597524395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:20,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:20,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:44:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481124751] [2024-11-22 00:44:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:44:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:20,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:44:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:20,071 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 00:44:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:20,087 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-22 00:44:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:44:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-22 00:44:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:20,098 INFO L225 Difference]: With dead ends: 31 [2024-11-22 00:44:20,098 INFO L226 Difference]: Without dead ends: 18 [2024-11-22 00:44:20,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:20,106 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:20,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-22 00:44:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-22 00:44:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:44:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-22 00:44:20,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 19 [2024-11-22 00:44:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:20,137 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-22 00:44:20,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 00:44:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-22 00:44:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 00:44:20,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:20,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:44:20,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1220515189, now seen corresponding path program 1 times [2024-11-22 00:44:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414908107] [2024-11-22 00:44:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:22,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:22,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414908107] [2024-11-22 00:44:22,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414908107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:22,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:22,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 00:44:22,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433863732] [2024-11-22 00:44:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:22,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 00:44:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:22,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 00:44:22,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:44:22,413 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 00:44:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:22,619 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-22 00:44:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:44:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-22 00:44:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:22,621 INFO L225 Difference]: With dead ends: 25 [2024-11-22 00:44:22,621 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 00:44:22,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-22 00:44:22,622 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:22,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:44:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 00:44:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-22 00:44:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:44:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-22 00:44:22,629 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 20 [2024-11-22 00:44:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:22,629 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-22 00:44:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 00:44:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-22 00:44:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 00:44:22,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:22,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:44:22,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:22,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:22,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1898823162, now seen corresponding path program 1 times [2024-11-22 00:44:22,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971910379] [2024-11-22 00:44:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971910379] [2024-11-22 00:44:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971910379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584353007] [2024-11-22 00:44:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:24,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:24,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:24,197 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-22 00:44:24,199 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-22 00:44:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:24,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 00:44:24,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:24,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2024-11-22 00:44:24,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:24,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2024-11-22 00:44:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:24,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584353007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:24,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 20 [2024-11-22 00:44:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854443526] [2024-11-22 00:44:24,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:24,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 00:44:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 00:44:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-22 00:44:24,659 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 00:44:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:25,242 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-22 00:44:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 00:44:25,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2024-11-22 00:44:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:25,243 INFO L225 Difference]: With dead ends: 31 [2024-11-22 00:44:25,243 INFO L226 Difference]: Without dead ends: 26 [2024-11-22 00:44:25,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2024-11-22 00:44:25,245 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:25,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 114 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:44:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-22 00:44:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-22 00:44:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:44:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-22 00:44:25,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2024-11-22 00:44:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:25,259 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-22 00:44:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 00:44:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-22 00:44:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:25,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:25,262 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:25,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 00:44:25,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:25,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:25,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -974313463, now seen corresponding path program 2 times [2024-11-22 00:44:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:25,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66878879] [2024-11-22 00:44:25,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:44:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:25,531 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:44:25,531 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:28,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:28,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66878879] [2024-11-22 00:44:28,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66878879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:28,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552187211] [2024-11-22 00:44:28,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:44:28,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:28,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:28,023 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-22 00:44:28,025 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-22 00:44:28,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:44:28,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:28,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 00:44:28,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2024-11-22 00:44:28,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2024-11-22 00:44:28,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 148 [2024-11-22 00:44:28,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 93 [2024-11-22 00:44:31,357 INFO L349 Elim1Store]: treesize reduction 15, result has 65.9 percent of original size [2024-11-22 00:44:31,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 107 [2024-11-22 00:44:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:31,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552187211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:32,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8, 8] total 31 [2024-11-22 00:44:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640167137] [2024-11-22 00:44:32,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:32,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 00:44:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 00:44:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2024-11-22 00:44:32,095 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 00:44:40,686 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 177 DAG size of output: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 00:44:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:45,166 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-22 00:44:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 00:44:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-22 00:44:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:45,167 INFO L225 Difference]: With dead ends: 43 [2024-11-22 00:44:45,167 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 00:44:45,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=389, Invalid=1963, Unknown=0, NotChecked=0, Total=2352 [2024-11-22 00:44:45,170 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:45,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 145 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 00:44:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 00:44:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 00:44:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:44:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-22 00:44:45,182 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 28 [2024-11-22 00:44:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-22 00:44:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 00:44:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-22 00:44:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:44:45,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:45,183 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:45,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 00:44:45,384 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,SelfDestructingSolverStorable3 [2024-11-22 00:44:45,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 638604903, now seen corresponding path program 3 times [2024-11-22 00:44:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460897936] [2024-11-22 00:44:45,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 00:44:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:45,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-22 00:44:45,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460897936] [2024-11-22 00:44:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460897936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712508360] [2024-11-22 00:44:46,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 00:44:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:46,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:46,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:44:46,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 00:44:46,559 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-22 00:44:46,560 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:46,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 00:44:46,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:46,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2024-11-22 00:44:47,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:47,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2024-11-22 00:44:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:47,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:47,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712508360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:47,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 27 [2024-11-22 00:44:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7873701] [2024-11-22 00:44:47,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:47,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 00:44:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 00:44:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-22 00:44:47,896 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 00:44:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:48,538 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-22 00:44:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 00:44:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-22 00:44:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:48,540 INFO L225 Difference]: With dead ends: 45 [2024-11-22 00:44:48,540 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 00:44:48,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=748, Invalid=1702, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 00:44:48,542 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:48,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:44:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 00:44:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 00:44:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:44:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-22 00:44:48,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 40 [2024-11-22 00:44:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:48,553 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-22 00:44:48,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 00:44:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-22 00:44:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:44:48,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:48,555 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:48,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 00:44:48,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:48,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1028786796, now seen corresponding path program 4 times [2024-11-22 00:44:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939016789] [2024-11-22 00:44:48,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 00:44:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:48,785 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 00:44:48,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 00:44:48,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:44:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:44:48,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:44:48,826 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:44:48,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 00:44:48,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 00:44:48,831 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2024-11-22 00:44:48,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:44:48,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:44:48 BoogieIcfgContainer [2024-11-22 00:44:48,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:44:48,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:44:48,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:44:48,890 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:44:48,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:19" (3/4) ... [2024-11-22 00:44:48,891 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 00:44:48,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 00:44:48,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:44:48,955 INFO L158 Benchmark]: Toolchain (without parser) took 30159.66ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 114.1MB in the beginning and 271.9MB in the end (delta: -157.9MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,955 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 81.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:44:48,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.93ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 100.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.73ms. Allocated memory is still 151.0MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,956 INFO L158 Benchmark]: Boogie Preprocessor took 52.51ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,956 INFO L158 Benchmark]: RCFGBuilder took 443.51ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 82.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,956 INFO L158 Benchmark]: TraceAbstraction took 29221.89ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 81.4MB in the beginning and 276.1MB in the end (delta: -194.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,957 INFO L158 Benchmark]: Witness Printer took 64.31ms. Allocated memory is still 362.8MB. Free memory was 276.1MB in the beginning and 271.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:44:48,958 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.19ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 81.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.93ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 100.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.73ms. Allocated memory is still 151.0MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.51ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.51ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 82.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29221.89ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 81.4MB in the beginning and 276.1MB in the end (delta: -194.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 64.31ms. Allocated memory is still 362.8MB. Free memory was 276.1MB in the beginning and 271.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; VAL [d1={4:0}, d2={5:0}] [L35] CALL init() [L16] d1.a = __VERIFIER_nondet_int() [L17] d1.b = __VERIFIER_nondet_int() [L19] d2.a = __VERIFIER_nondet_int() [L20] d2.b = __VERIFIER_nondet_int() [L35] RET init() [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, pd1={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L37] int i = __VERIFIER_nondet_int(); [L38] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L39] pd2->array[i] = i [L40] int *pa = &pd1->array[i]; [L41] EXPR pd2->array[i] [L41] i = pd2->array[i] - 10 [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-9, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-8, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-7, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-6, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-5, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-4, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-2, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-1, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=0, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=1, pa={4:8}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND FALSE !(i <= *pa) [L45] CALL, EXPR check(pd2, i) [L30] EXPR s1->array[i] [L30] return s1->array[i] == i; [L45] RET, EXPR check(pd2, i) [L45] COND TRUE !check(pd2, i) [L52] reach_error() VAL [d1={4:0}, d2={5:0}, pa={4:8}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 319 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 75 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 153 SyntacticMatches, 10 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 298 ConstructedInterpolants, 9 QuantifiedInterpolants, 4480 SizeOfPredicates, 32 NumberOfNonLiveVariables, 693 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 33/429 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-22 00:44:49,006 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE