./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-wip.fs.cvc5-61a6796-m [2024-10-14 01:43:47,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:43:47,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:43:47,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:43:47,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:43:47,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:43:47,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:43:47,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:43:47,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:43:47,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:43:47,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:43:47,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:43:47,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:43:47,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:43:47,639 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:43:47,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:43:47,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:43:47,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:43:47,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:43:47,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:43:47,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:43:47,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:43:47,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:43:47,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:43:47,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:43:47,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:43:47,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:43:47,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:43:47,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:43:47,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:43:47,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:43:47,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:43:47,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:43:47,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:43:47,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:43:47,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:43:47,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:43:47,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:43:47,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:43:47,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:43:47,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:43:47,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:43:47,652 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-10-14 01:43:47,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:43:47,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:43:47,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:43:47,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:43:47,869 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:43:47,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c [2024-10-14 01:43:49,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:43:49,419 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:43:49,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c [2024-10-14 01:43:49,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885430fa0/c038cb3450044f20b8f50ff471fd5ff1/FLAG6552c6f61 [2024-10-14 01:43:49,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885430fa0/c038cb3450044f20b8f50ff471fd5ff1 [2024-10-14 01:43:49,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:43:49,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:43:49,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:43:49,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:43:49,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:43:49,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474bb441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49, skipping insertion in model container [2024-10-14 01:43:49,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:43:49,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c[1075,1088] [2024-10-14 01:43:49,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:43:49,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:43:49,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c[1075,1088] [2024-10-14 01:43:49,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:43:49,652 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:43:49,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49 WrapperNode [2024-10-14 01:43:49,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:43:49,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:43:49,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:43:49,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:43:49,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,681 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2024-10-14 01:43:49,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:43:49,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:43:49,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:43:49,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:43:49,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,713 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-10-14 01:43:49,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:43:49,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:43:49,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:43:49,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:43:49,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (1/1) ... [2024-10-14 01:43:49,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:43:49,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:49,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:43:49,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:43:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:43:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:43:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:43:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:43:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:43:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-10-14 01:43:49,855 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-10-14 01:43:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:43:49,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:43:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:43:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:43:49,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:43:49,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:43:50,080 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 01:43:50,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:43:50,118 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:43:50,119 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 01:43:50,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:50 BoogieIcfgContainer [2024-10-14 01:43:50,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:43:50,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:43:50,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:43:50,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:43:50,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:43:49" (1/3) ... [2024-10-14 01:43:50,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acc356b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:50, skipping insertion in model container [2024-10-14 01:43:50,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:49" (2/3) ... [2024-10-14 01:43:50,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acc356b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:50, skipping insertion in model container [2024-10-14 01:43:50,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:50" (3/3) ... [2024-10-14 01:43:50,126 INFO L112 eAbstractionObserver]: Analyzing ICFG test23-1.c [2024-10-14 01:43:50,140 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:43:50,140 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:43:50,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:43:50,189 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;@516507f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:43:50,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:43:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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-10-14 01:43:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:43:50,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:50,199 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:50,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:50,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash -35949440, now seen corresponding path program 1 times [2024-10-14 01:43:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046109547] [2024-10-14 01:43:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 01:43:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:43:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046109547] [2024-10-14 01:43:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046109547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:43:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511425642] [2024-10-14 01:43:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:43:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:43:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:43:50,391 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 01:43:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:50,415 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-14 01:43:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:43:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 14 [2024-10-14 01:43:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:50,422 INFO L225 Difference]: With dead ends: 24 [2024-10-14 01:43:50,422 INFO L226 Difference]: Without dead ends: 14 [2024-10-14 01:43:50,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:43:50,426 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:50,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:43:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-14 01:43:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-14 01:43:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-10-14 01:43:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-14 01:43:50,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 14 [2024-10-14 01:43:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-14 01:43:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 01:43:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-14 01:43:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:43:50,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:50,456 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:50,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:43:50,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:50,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1121744136, now seen corresponding path program 1 times [2024-10-14 01:43:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528229770] [2024-10-14 01:43:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 01:43:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:43:50,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528229770] [2024-10-14 01:43:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528229770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:50,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:43:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900764244] [2024-10-14 01:43:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:50,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:43:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:43:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:43:50,789 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-14 01:43:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:50,826 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-14 01:43:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:43:50,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 15 [2024-10-14 01:43:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:50,827 INFO L225 Difference]: With dead ends: 20 [2024-10-14 01:43:50,827 INFO L226 Difference]: Without dead ends: 16 [2024-10-14 01:43:50,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-14 01:43:50,829 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:50,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:43:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-14 01:43:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-14 01:43:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-10-14 01:43:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-10-14 01:43:50,832 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2024-10-14 01:43:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:50,833 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-14 01:43:50,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-14 01:43:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-10-14 01:43:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 01:43:50,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:50,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:50,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:43:50,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:50,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 68065171, now seen corresponding path program 1 times [2024-10-14 01:43:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132301143] [2024-10-14 01:43:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 01:43:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:43:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132301143] [2024-10-14 01:43:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132301143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188991450] [2024-10-14 01:43:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:51,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:51,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:51,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:43:51,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:43:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:51,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 01:43:51,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:51,279 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-10-14 01:43:51,341 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 39 treesize of output 28 [2024-10-14 01:43:51,351 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 17 [2024-10-14 01:43:51,492 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 152 treesize of output 102 [2024-10-14 01:44:12,081 INFO L349 Elim1Store]: treesize reduction 10, result has 77.3 percent of original size [2024-10-14 01:44:12,082 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 141 treesize of output 120 [2024-10-14 01:44:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:12,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188991450] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:12,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:12,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-10-14 01:44:12,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358472217] [2024-10-14 01:44:12,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:12,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:44:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:12,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:44:12,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=67, Unknown=5, NotChecked=0, Total=110 [2024-10-14 01:44:12,298 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-10-14 01:44:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:12,634 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-10-14 01:44:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:12,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 17 [2024-10-14 01:44:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:12,637 INFO L225 Difference]: With dead ends: 26 [2024-10-14 01:44:12,637 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 01:44:12,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=83, Invalid=152, Unknown=5, NotChecked=0, Total=240 [2024-10-14 01:44:12,640 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:12,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 01:44:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 01:44:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-10-14 01:44:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-14 01:44:12,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2024-10-14 01:44:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:12,648 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-14 01:44:12,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-10-14 01:44:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-14 01:44:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:44:12,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:12,649 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:12,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:44:12,853 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-10-14 01:44:12,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1001513756, now seen corresponding path program 2 times [2024-10-14 01:44:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480060556] [2024-10-14 01:44:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:44:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 01:44:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480060556] [2024-10-14 01:44:13,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480060556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:13,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038925954] [2024-10-14 01:44:13,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:13,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:13,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:13,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:13,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:44:13,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:13,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:13,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 01:44:13,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:13,378 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-10-14 01:44:13,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2024-10-14 01:44:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:13,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038925954] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:13,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-10-14 01:44:13,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168118987] [2024-10-14 01:44:13,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:13,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 01:44:13,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:13,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 01:44:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2024-10-14 01:44:13,657 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-10-14 01:44:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:13,830 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-14 01:44:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 01:44:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 23 [2024-10-14 01:44:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:13,832 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:44:13,832 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 01:44:13,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=407, Unknown=0, NotChecked=0, Total=650 [2024-10-14 01:44:13,834 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:13,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 01:44:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 01:44:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-10-14 01:44:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-14 01:44:13,839 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 23 [2024-10-14 01:44:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:13,840 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-14 01:44:13,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-10-14 01:44:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-14 01:44:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 01:44:13,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:13,841 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:13,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 01:44:14,045 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-10-14 01:44:14,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1451472198, now seen corresponding path program 3 times [2024-10-14 01:44:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067874104] [2024-10-14 01:44:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:44:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 01:44:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:14,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067874104] [2024-10-14 01:44:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067874104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685612665] [2024-10-14 01:44:14,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 01:44:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:14,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:14,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:44:14,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 01:44:14,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:14,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 01:44:14,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:14,898 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-10-14 01:44:15,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:15,399 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-10-14 01:44:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:15,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:44:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685612665] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:15,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:15,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 26 [2024-10-14 01:44:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048444031] [2024-10-14 01:44:15,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:15,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 01:44:15,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:15,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 01:44:15,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-10-14 01:44:15,869 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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-10-14 01:44:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:16,243 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-10-14 01:44:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 01:44:16,244 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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 35 [2024-10-14 01:44:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:16,244 INFO L225 Difference]: With dead ends: 40 [2024-10-14 01:44:16,244 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 01:44:16,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=293, Invalid=1039, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 01:44:16,246 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:16,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:44:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 01:44:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 01:44:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-10-14 01:44:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-10-14 01:44:16,254 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 35 [2024-10-14 01:44:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-10-14 01:44:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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-10-14 01:44:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-10-14 01:44:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 01:44:16,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:16,256 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:16,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:44:16,460 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-10-14 01:44:16,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash -972200351, now seen corresponding path program 4 times [2024-10-14 01:44:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223723917] [2024-10-14 01:44:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:44:16,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:44:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:44:16,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 01:44:16,569 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:44:16,570 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:44:16,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 01:44:16,579 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2024-10-14 01:44:16,638 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:44:16,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:44:16 BoogieIcfgContainer [2024-10-14 01:44:16,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:44:16,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:44:16,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:44:16,649 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:44:16,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:50" (3/4) ... [2024-10-14 01:44:16,650 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 01:44:16,732 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:44:16,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:44:16,735 INFO L158 Benchmark]: Toolchain (without parser) took 27294.65ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 114.9MB in the beginning and 90.2MB in the end (delta: 24.7MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,735 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 115.3MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:44:16,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.53ms. Allocated memory is still 180.4MB. Free memory was 114.9MB in the beginning and 102.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.04ms. Allocated memory is still 180.4MB. Free memory was 102.8MB in the beginning and 101.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,738 INFO L158 Benchmark]: Boogie Preprocessor took 47.66ms. Allocated memory is still 180.4MB. Free memory was 101.2MB in the beginning and 99.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,738 INFO L158 Benchmark]: RCFGBuilder took 389.19ms. Allocated memory is still 180.4MB. Free memory was 98.9MB in the beginning and 140.3MB in the end (delta: -41.5MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,739 INFO L158 Benchmark]: TraceAbstraction took 26527.49ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 139.6MB in the beginning and 94.4MB in the end (delta: 45.2MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,739 INFO L158 Benchmark]: Witness Printer took 85.89ms. Allocated memory is still 247.5MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:44:16,740 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.12ms. Allocated memory is still 115.3MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.53ms. Allocated memory is still 180.4MB. Free memory was 114.9MB in the beginning and 102.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.04ms. Allocated memory is still 180.4MB. Free memory was 102.8MB in the beginning and 101.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.66ms. Allocated memory is still 180.4MB. Free memory was 101.2MB in the beginning and 99.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.19ms. Allocated memory is still 180.4MB. Free memory was 98.9MB in the beginning and 140.3MB in the end (delta: -41.5MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26527.49ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 139.6MB in the beginning and 94.4MB in the end (delta: 45.2MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. * Witness Printer took 85.89ms. Allocated memory is still 247.5MB. Free memory was 94.4MB in the beginning and 90.2MB 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; [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, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 55 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 140 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=5, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 243 ConstructedInterpolants, 3 QuantifiedInterpolants, 2358 SizeOfPredicates, 33 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 22/418 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-10-14 01:44:16,816 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