./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum20.i -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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 09:52:06,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 09:52:07,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 09:52:07,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 09:52:07,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 09:52:07,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 09:52:07,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 09:52:07,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 09:52:07,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 09:52:07,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 09:52:07,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 09:52:07,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 09:52:07,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 09:52:07,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 09:52:07,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 09:52:07,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 09:52:07,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 09:52:07,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 09:52:07,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 09:52:07,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 09:52:07,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 09:52:07,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 09:52:07,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 09:52:07,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 09:52:07,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 09:52:07,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 09:52:07,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 09:52:07,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 09:52:07,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 09:52:07,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 09:52:07,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 09:52:07,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 09:52:07,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:52:07,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 09:52:07,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 09:52:07,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 09:52:07,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 09:52:07,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 09:52:07,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 09:52:07,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 09:52:07,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 09:52:07,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 09:52:07,070 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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2024-11-08 09:52:07,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 09:52:07,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 09:52:07,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 09:52:07,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 09:52:07,359 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 09:52:07,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-08 09:52:08,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 09:52:09,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 09:52:09,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-08 09:52:09,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d16bc90/cb07cc25ac5d4d0aa05de71ab8e61045/FLAG6bcb426ce [2024-11-08 09:52:09,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d16bc90/cb07cc25ac5d4d0aa05de71ab8e61045 [2024-11-08 09:52:09,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 09:52:09,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 09:52:09,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 09:52:09,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 09:52:09,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 09:52:09,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09, skipping insertion in model container [2024-11-08 09:52:09,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 09:52:09,279 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/reducercommutativity/rangesum20.i[1465,1478] [2024-11-08 09:52:09,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:52:09,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 09:52:09,328 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/reducercommutativity/rangesum20.i[1465,1478] [2024-11-08 09:52:09,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:52:09,349 INFO L204 MainTranslator]: Completed translation [2024-11-08 09:52:09,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09 WrapperNode [2024-11-08 09:52:09,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 09:52:09,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 09:52:09,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 09:52:09,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 09:52:09,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,394 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-08 09:52:09,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 09:52:09,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 09:52:09,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 09:52:09,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 09:52:09,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,433 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 5 writes are split as follows [0, 5]. [2024-11-08 09:52:09,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 09:52:09,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 09:52:09,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 09:52:09,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 09:52:09,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (1/1) ... [2024-11-08 09:52:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:52:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:09,499 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-08 09:52:09,502 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-08 09:52:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 09:52:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 09:52:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 09:52:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 09:52:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 09:52:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 09:52:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 09:52:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 09:52:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 09:52:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 09:52:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-08 09:52:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-08 09:52:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 09:52:09,651 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 09:52:09,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 09:52:09,842 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 09:52:09,843 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 09:52:09,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 09:52:09,861 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 09:52:09,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:52:09 BoogieIcfgContainer [2024-11-08 09:52:09,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 09:52:09,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 09:52:09,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 09:52:09,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 09:52:09,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:52:09" (1/3) ... [2024-11-08 09:52:09,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:52:09, skipping insertion in model container [2024-11-08 09:52:09,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:52:09" (2/3) ... [2024-11-08 09:52:09,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:52:09, skipping insertion in model container [2024-11-08 09:52:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:52:09" (3/3) ... [2024-11-08 09:52:09,873 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2024-11-08 09:52:09,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 09:52:09,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 09:52:09,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 09:52:09,961 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;@6820aecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 09:52:09,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 09:52:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 09:52:09,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:09,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:09,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:09,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2024-11-08 09:52:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163658024] [2024-11-08 09:52:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 09:52:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 09:52:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 09:52:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:52:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:10,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163658024] [2024-11-08 09:52:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163658024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:52:10,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:52:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 09:52:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453281839] [2024-11-08 09:52:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:52:10,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:52:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:52:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:52:10,367 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 09:52:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:10,396 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-11-08 09:52:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:52:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-08 09:52:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:10,404 INFO L225 Difference]: With dead ends: 54 [2024-11-08 09:52:10,404 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 09:52:10,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:52:10,409 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:10,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 09:52:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-08 09:52:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-08 09:52:10,439 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-08 09:52:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:10,440 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-08 09:52:10,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 09:52:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-08 09:52:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 09:52:10,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:10,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:10,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 09:52:10,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:10,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2024-11-08 09:52:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:10,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008387663] [2024-11-08 09:52:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:10,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 09:52:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 09:52:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 09:52:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:52:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008387663] [2024-11-08 09:52:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008387663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617790283] [2024-11-08 09:52:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:10,757 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-08 09:52:10,759 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-08 09:52:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:10,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 09:52:10,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 09:52:10,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:52:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617790283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:52:10,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:52:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 09:52:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192322457] [2024-11-08 09:52:10,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:52:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:52:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:52:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 09:52:10,908 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:52:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:10,929 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-08 09:52:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:52:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-08 09:52:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:10,933 INFO L225 Difference]: With dead ends: 46 [2024-11-08 09:52:10,933 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 09:52:10,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 09:52:10,934 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:10,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 09:52:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 09:52:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-08 09:52:10,943 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-11-08 09:52:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:10,943 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-08 09:52:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:52:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-08 09:52:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 09:52:10,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:10,948 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:10,966 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-08 09:52:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:11,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:11,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2024-11-08 09:52:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625608442] [2024-11-08 09:52:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 09:52:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 09:52:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 09:52:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 09:52:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625608442] [2024-11-08 09:52:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625608442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398763506] [2024-11-08 09:52:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:11,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:11,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:11,355 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-08 09:52:11,356 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-08 09:52:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 09:52:11,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 09:52:11,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:52:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398763506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:52:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:52:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-08 09:52:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529528292] [2024-11-08 09:52:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:52:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:52:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:52:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 09:52:11,483 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:52:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:11,505 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-08 09:52:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:52:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-08 09:52:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:11,507 INFO L225 Difference]: With dead ends: 44 [2024-11-08 09:52:11,507 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 09:52:11,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 09:52:11,509 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:11,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 09:52:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-08 09:52:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-08 09:52:11,516 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2024-11-08 09:52:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:11,517 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-08 09:52:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:52:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-08 09:52:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 09:52:11,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:11,519 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:11,532 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-08 09:52:11,722 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,SelfDestructingSolverStorable2 [2024-11-08 09:52:11,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2024-11-08 09:52:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756258428] [2024-11-08 09:52:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 09:52:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 09:52:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 09:52:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:52:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756258428] [2024-11-08 09:52:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756258428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124325884] [2024-11-08 09:52:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:11,892 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-08 09:52:11,893 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-08 09:52:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:11,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 09:52:11,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 09:52:12,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:52:12,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124325884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:52:12,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:52:12,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-08 09:52:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222244730] [2024-11-08 09:52:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:52:12,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:52:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:52:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 09:52:12,015 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:52:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:12,026 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-08 09:52:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:52:12,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-08 09:52:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:12,028 INFO L225 Difference]: With dead ends: 53 [2024-11-08 09:52:12,028 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 09:52:12,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 09:52:12,029 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:12,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 09:52:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 09:52:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-08 09:52:12,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2024-11-08 09:52:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:12,035 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-08 09:52:12,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:52:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-08 09:52:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 09:52:12,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:12,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:12,055 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-08 09:52:12,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:12,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:12,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2024-11-08 09:52:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19867339] [2024-11-08 09:52:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 09:52:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 09:52:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 09:52:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:52:12,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19867339] [2024-11-08 09:52:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19867339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336795293] [2024-11-08 09:52:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:12,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:12,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:12,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 09:52:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 09:52:12,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 09:52:12,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 09:52:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336795293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:12,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-08 09:52:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572342662] [2024-11-08 09:52:12,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 09:52:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 09:52:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 09:52:12,519 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 09:52:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:12,581 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-08 09:52:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 09:52:12,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-11-08 09:52:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:12,583 INFO L225 Difference]: With dead ends: 69 [2024-11-08 09:52:12,583 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 09:52:12,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 09:52:12,584 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:12,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 09:52:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-08 09:52:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-08 09:52:12,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-11-08 09:52:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:12,598 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-08 09:52:12,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 09:52:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-08 09:52:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 09:52:12,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:12,600 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:12,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 09:52:12,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:12,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:12,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2024-11-08 09:52:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171238656] [2024-11-08 09:52:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:12,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 09:52:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 09:52:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 09:52:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-08 09:52:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171238656] [2024-11-08 09:52:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171238656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476365781] [2024-11-08 09:52:12,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:52:12,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:12,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:12,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:12,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 09:52:13,024 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:52:13,025 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:13,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 09:52:13,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-08 09:52:13,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-08 09:52:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476365781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:13,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-08 09:52:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483695629] [2024-11-08 09:52:13,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:13,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 09:52:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 09:52:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-08 09:52:13,199 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:52:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:13,281 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-11-08 09:52:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 09:52:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-11-08 09:52:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:13,283 INFO L225 Difference]: With dead ends: 86 [2024-11-08 09:52:13,283 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 09:52:13,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-08 09:52:13,284 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:13,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 09:52:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-08 09:52:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-08 09:52:13,295 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 57 [2024-11-08 09:52:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:13,296 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-08 09:52:13,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:52:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-08 09:52:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 09:52:13,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:13,298 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:13,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 09:52:13,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:13,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:13,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2024-11-08 09:52:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331493272] [2024-11-08 09:52:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 09:52:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 09:52:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 09:52:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-08 09:52:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331493272] [2024-11-08 09:52:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331493272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:13,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418352391] [2024-11-08 09:52:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:13,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:13,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:13,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 09:52:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:13,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 09:52:13,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 09:52:13,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 09:52:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418352391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:14,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 24 [2024-11-08 09:52:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293000545] [2024-11-08 09:52:14,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 09:52:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:14,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 09:52:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-08 09:52:14,146 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 09:52:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:14,267 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2024-11-08 09:52:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 09:52:14,267 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-08 09:52:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:14,269 INFO L225 Difference]: With dead ends: 102 [2024-11-08 09:52:14,269 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 09:52:14,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-08 09:52:14,270 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:14,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 09:52:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-08 09:52:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-08 09:52:14,278 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 78 [2024-11-08 09:52:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-08 09:52:14,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 09:52:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-08 09:52:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 09:52:14,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:14,280 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:14,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:14,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:14,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1718843700, now seen corresponding path program 2 times [2024-11-08 09:52:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574090423] [2024-11-08 09:52:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 09:52:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 09:52:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-08 09:52:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574090423] [2024-11-08 09:52:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574090423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145216622] [2024-11-08 09:52:14,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:52:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:14,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:14,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 09:52:14,852 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:52:14,852 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:14,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:52:14,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-08 09:52:14,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-08 09:52:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145216622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:14,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 09:52:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693164803] [2024-11-08 09:52:14,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 09:52:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:14,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 09:52:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 09:52:14,917 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 09:52:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:14,946 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2024-11-08 09:52:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 09:52:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-08 09:52:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:14,948 INFO L225 Difference]: With dead ends: 113 [2024-11-08 09:52:14,948 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 09:52:14,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 09:52:14,949 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:14,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 09:52:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 09:52:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-08 09:52:14,961 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 100 [2024-11-08 09:52:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:14,961 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-08 09:52:14,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 09:52:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-08 09:52:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 09:52:14,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:14,968 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:14,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:15,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:15,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1145442804, now seen corresponding path program 3 times [2024-11-08 09:52:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063261460] [2024-11-08 09:52:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 09:52:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 09:52:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-11-08 09:52:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:15,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063261460] [2024-11-08 09:52:15,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063261460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627798368] [2024-11-08 09:52:15,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 09:52:15,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:15,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:15,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:15,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 09:52:15,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 09:52:15,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:15,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:52:15,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-08 09:52:15,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-08 09:52:15,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627798368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:15,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:15,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2024-11-08 09:52:15,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223702689] [2024-11-08 09:52:15,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:15,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 09:52:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 09:52:15,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-08 09:52:15,697 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:52:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:15,755 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2024-11-08 09:52:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 09:52:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 136 [2024-11-08 09:52:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:15,759 INFO L225 Difference]: With dead ends: 143 [2024-11-08 09:52:15,759 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 09:52:15,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-08 09:52:15,760 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:15,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 09:52:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-08 09:52:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-08 09:52:15,773 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 136 [2024-11-08 09:52:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:15,774 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-08 09:52:15,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:52:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-08 09:52:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 09:52:15,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:15,776 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 24, 20, 20, 15, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:15,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:15,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 09:52:15,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1379176084, now seen corresponding path program 4 times [2024-11-08 09:52:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481213980] [2024-11-08 09:52:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 09:52:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:16,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 09:52:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 121 proven. 1174 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-11-08 09:52:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481213980] [2024-11-08 09:52:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481213980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669467092] [2024-11-08 09:52:16,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 09:52:16,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:16,383 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:16,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 09:52:16,514 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 09:52:16,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:16,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 09:52:16,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 817 proven. 100 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2024-11-08 09:52:16,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 121 proven. 1174 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-11-08 09:52:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669467092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:16,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:16,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-08 09:52:16,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689035800] [2024-11-08 09:52:16,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:16,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 09:52:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 09:52:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-08 09:52:16,697 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 09:52:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:16,746 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2024-11-08 09:52:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 09:52:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-08 09:52:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:16,748 INFO L225 Difference]: With dead ends: 170 [2024-11-08 09:52:16,748 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 09:52:16,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 377 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-08 09:52:16,749 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:16,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 09:52:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 09:52:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-11-08 09:52:16,767 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 190 [2024-11-08 09:52:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-11-08 09:52:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 09:52:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-11-08 09:52:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 09:52:16,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:16,771 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 33, 20, 20, 15, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:16,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 09:52:16,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 09:52:16,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:16,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 322135401, now seen corresponding path program 5 times [2024-11-08 09:52:16,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:16,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021292655] [2024-11-08 09:52:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 09:52:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 09:52:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3943 trivial. 0 not checked. [2024-11-08 09:52:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:17,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021292655] [2024-11-08 09:52:17,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021292655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:17,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664772506] [2024-11-08 09:52:17,241 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 09:52:17,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:17,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:17,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:17,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 09:52:17,357 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-08 09:52:17,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:17,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 09:52:17,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 1785 proven. 40 refuted. 0 times theorem prover too weak. 2122 trivial. 0 not checked. [2024-11-08 09:52:17,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 181 proven. 602 refuted. 0 times theorem prover too weak. 3164 trivial. 0 not checked. [2024-11-08 09:52:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664772506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:17,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2024-11-08 09:52:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394383281] [2024-11-08 09:52:17,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 09:52:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 09:52:17,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-08 09:52:17,547 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:52:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:17,615 INFO L93 Difference]: Finished difference Result 194 states and 224 transitions. [2024-11-08 09:52:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 09:52:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 217 [2024-11-08 09:52:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:17,617 INFO L225 Difference]: With dead ends: 194 [2024-11-08 09:52:17,617 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 09:52:17,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 426 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-08 09:52:17,618 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:17,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 09:52:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-08 09:52:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 121 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2024-11-08 09:52:17,633 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 217 [2024-11-08 09:52:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:17,633 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2024-11-08 09:52:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:52:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2024-11-08 09:52:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 09:52:17,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:17,636 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:17,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 09:52:17,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 09:52:17,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:17,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash -575874009, now seen corresponding path program 6 times [2024-11-08 09:52:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:17,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839954347] [2024-11-08 09:52:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 09:52:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 09:52:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-08 09:52:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839954347] [2024-11-08 09:52:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839954347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407764184] [2024-11-08 09:52:18,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 09:52:18,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:18,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:18,120 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:18,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 09:52:18,293 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-08 09:52:18,293 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:18,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 09:52:18,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 2490 proven. 9 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-08 09:52:18,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-08 09:52:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407764184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:18,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:18,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-08 09:52:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089027693] [2024-11-08 09:52:18,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:18,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 09:52:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 09:52:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:52:18,385 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 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-08 09:52:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:18,430 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2024-11-08 09:52:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 09:52:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 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 255 [2024-11-08 09:52:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:18,433 INFO L225 Difference]: With dead ends: 207 [2024-11-08 09:52:18,433 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 09:52:18,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:52:18,434 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:18,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 09:52:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-08 09:52:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.099236641221374) internal successors, (144), 131 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-08 09:52:18,446 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 255 [2024-11-08 09:52:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:18,451 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-08 09:52:18,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 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-08 09:52:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-08 09:52:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-08 09:52:18,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:18,454 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:18,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 09:52:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 09:52:18,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:18,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash -545735139, now seen corresponding path program 7 times [2024-11-08 09:52:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072740865] [2024-11-08 09:52:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 09:52:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-08 09:52:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-08 09:52:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072740865] [2024-11-08 09:52:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072740865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:19,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144325434] [2024-11-08 09:52:19,045 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 09:52:19,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:19,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:19,047 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:19,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 09:52:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:19,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 09:52:19,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 2490 proven. 64 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-08 09:52:19,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-08 09:52:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144325434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:19,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:19,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-08 09:52:19,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717267502] [2024-11-08 09:52:19,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 09:52:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 09:52:19,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-08 09:52:19,467 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 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-08 09:52:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:19,528 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2024-11-08 09:52:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 09:52:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 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 265 [2024-11-08 09:52:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:19,530 INFO L225 Difference]: With dead ends: 227 [2024-11-08 09:52:19,530 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 09:52:19,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-08 09:52:19,531 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:19,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:52:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 09:52:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-08 09:52:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.086092715231788) internal successors, (164), 151 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-08 09:52:19,540 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 265 [2024-11-08 09:52:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:19,541 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-08 09:52:19,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 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-08 09:52:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-08 09:52:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-08 09:52:19,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:19,545 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:19,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:19,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 09:52:19,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:19,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash 762343305, now seen corresponding path program 8 times [2024-11-08 09:52:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:19,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598033249] [2024-11-08 09:52:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:20,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 09:52:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:20,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 09:52:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-08 09:52:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598033249] [2024-11-08 09:52:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598033249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72873849] [2024-11-08 09:52:20,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:52:20,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:20,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:20,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:20,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 09:52:20,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:52:20,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:20,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 09:52:20,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 2490 proven. 324 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-08 09:52:20,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-08 09:52:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72873849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:21,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 22 [2024-11-08 09:52:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450189723] [2024-11-08 09:52:21,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 09:52:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 09:52:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-08 09:52:21,058 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 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-08 09:52:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:21,120 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2024-11-08 09:52:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 09:52:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 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 285 [2024-11-08 09:52:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:21,122 INFO L225 Difference]: With dead ends: 229 [2024-11-08 09:52:21,122 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 09:52:21,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 556 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-08 09:52:21,123 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:21,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 09:52:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-08 09:52:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 153 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:52:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2024-11-08 09:52:21,131 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 285 [2024-11-08 09:52:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2024-11-08 09:52:21,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 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-08 09:52:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2024-11-08 09:52:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-08 09:52:21,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:21,134 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:21,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 09:52:21,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 09:52:21,339 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:21,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1541531655, now seen corresponding path program 9 times [2024-11-08 09:52:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:21,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190303379] [2024-11-08 09:52:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 09:52:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413697786] [2024-11-08 09:52:21,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 09:52:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:21,903 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:21,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 09:52:32,058 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2024-11-08 09:52:32,058 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 09:52:32,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 09:52:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 09:52:34,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 09:52:34,213 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 09:52:34,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 09:52:34,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:34,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:34,424 INFO L407 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1] [2024-11-08 09:52:34,557 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 09:52:34,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:52:34 BoogieIcfgContainer [2024-11-08 09:52:34,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 09:52:34,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 09:52:34,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 09:52:34,561 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 09:52:34,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:52:09" (3/4) ... [2024-11-08 09:52:34,564 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 09:52:34,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 09:52:34,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 09:52:34,692 INFO L158 Benchmark]: Toolchain (without parser) took 25619.13ms. Allocated memory was 178.3MB in the beginning and 343.9MB in the end (delta: 165.7MB). Free memory was 122.8MB in the beginning and 128.5MB in the end (delta: -5.7MB). Peak memory consumption was 161.3MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,692 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory was 143.1MB in the beginning and 142.8MB in the end (delta: 276.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 09:52:34,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.64ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 108.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.57ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 106.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,697 INFO L158 Benchmark]: Boogie Preprocessor took 63.10ms. Allocated memory is still 178.3MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,697 INFO L158 Benchmark]: RCFGBuilder took 403.13ms. Allocated memory is still 178.3MB. Free memory was 104.8MB in the beginning and 91.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,697 INFO L158 Benchmark]: TraceAbstraction took 24694.18ms. Allocated memory was 178.3MB in the beginning and 343.9MB in the end (delta: 165.7MB). Free memory was 90.5MB in the beginning and 145.4MB in the end (delta: -54.9MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,697 INFO L158 Benchmark]: Witness Printer took 130.65ms. Allocated memory is still 343.9MB. Free memory was 144.4MB in the beginning and 128.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 09:52:34,699 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.22ms. Allocated memory is still 178.3MB. Free memory was 143.1MB in the beginning and 142.8MB in the end (delta: 276.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.64ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 108.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.57ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 106.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.10ms. Allocated memory is still 178.3MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.13ms. Allocated memory is still 178.3MB. Free memory was 104.8MB in the beginning and 91.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24694.18ms. Allocated memory was 178.3MB in the beginning and 343.9MB in the end (delta: 165.7MB). Free memory was 90.5MB in the beginning and 145.4MB in the end (delta: -54.9MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * Witness Printer took 130.65ms. Allocated memory is still 343.9MB. Free memory was 144.4MB in the beginning and 128.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. 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: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={4:0}] [L17] COND FALSE !(i < 20) VAL [x={4:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={4:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=1, i=11, ret=10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=2, i=12, ret=21, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=3, i=13, ret=8, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=4, i=14, ret=-6, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=5, i=15, ret=-24, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=6, i=16, ret=-19, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=7, i=17, ret=-16, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=8, i=18, ret=-10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=9, i=19, ret=-1, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=9, i=20, ret=-1, x={4:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={4:0}, cnt=9, ret=-1, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={4:0}, \result=0, x={4:0}] [L49] RET, EXPR rangesum(x) VAL [x={4:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=1, i=11, ret=10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=2, i=12, ret=21, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=3, i=13, ret=8, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=4, i=14, ret=-6, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=5, i=15, ret=-24, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=6, i=16, ret=-19, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=7, i=17, ret=-16, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=8, i=18, ret=-10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=9, i=19, ret=-1, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=9, i=20, ret=-1, x={4:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={4:0}, cnt=9, ret=-1, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={4:0}, \result=0, x={4:0}] [L52] RET, EXPR rangesum(x) VAL [ret=0, x={4:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND FALSE !(i<20 -1) VAL [ret2=0, ret=0, temp=-15, x={4:0}] [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=1, i=11, ret=11, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=12, ret=11, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=1, i=12, ret=11, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=2, i=12, ret=-2, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=13, ret=-2, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=2, i=13, ret=-2, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=3, i=13, ret=-16, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=3, i=14, ret=-16, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=3, i=14, ret=-16, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=4, i=14, ret=-34, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=4, i=15, ret=-34, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=4, i=15, ret=-34, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=5, i=15, ret=-29, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=5, i=16, ret=-29, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=5, i=16, ret=-29, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=6, i=16, ret=-26, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=6, i=17, ret=-26, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=6, i=17, ret=-26, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=7, i=17, ret=-20, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=7, i=18, ret=-20, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=7, i=18, ret=-20, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=8, i=18, ret=-11, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=8, i=19, ret=-11, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=8, i=19, ret=-11, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=9, i=19, ret=-26, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=9, i=20, ret=-26, x={4:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={4:0}, cnt=9, ret=-26, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={4:0}, \result=-2, x={4:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=0, ret=0, x={4:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={4:0}] [L61] reach_error() VAL [x={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 15, TraceHistogramMax: 60, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 1311 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 378 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3529 GetRequests, 3351 SyntacticMatches, 32 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=14, InterpolantAutomatonStates: 160, 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, 14 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 4079 NumberOfCodeBlocks, 3543 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 5093 ConstructedInterpolants, 0 QuantifiedInterpolants, 6007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3843 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 37 InterpolantComputations, 4 PerfectInterpolantSequences, 75623/80780 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-08 09:52:34,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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