./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:02:21,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:02:21,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:02:21,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:02:21,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:02:21,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:02:21,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:02:21,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:02:21,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:02:21,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:02:21,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:02:21,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:02:21,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:02:21,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:02:21,345 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:02:21,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:02:21,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:02:21,346 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:02:21,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:02:21,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:02:21,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:02:21,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:02:21,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:02:21,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:02:21,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:02:21,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:02:21,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:02:21,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:02:21,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:02:21,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:02:21,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:02:21,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:02:21,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:02:21,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:02:21,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:02:21,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:02:21,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:02:21,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:02:21,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:02:21,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:02:21,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:02:21,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:02:21,357 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-09 18:02:21,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:02:21,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:02:21,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:02:21,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:02:21,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:02:21,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-09 18:02:23,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:02:23,355 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:02:23,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-09 18:02:23,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3c75746/8107309d38a84cc4ba816c625e5f3a1f/FLAG962687b6f [2024-11-09 18:02:23,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3c75746/8107309d38a84cc4ba816c625e5f3a1f [2024-11-09 18:02:23,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:02:23,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:02:23,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:02:23,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:02:23,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:02:23,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:23" (1/1) ... [2024-11-09 18:02:23,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efc4271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:23, skipping insertion in model container [2024-11-09 18:02:23,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:23" (1/1) ... [2024-11-09 18:02:23,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:02:23,967 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-09 18:02:23,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:02:23,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:02:24,002 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-09 18:02:24,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:02:24,018 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:02:24,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24 WrapperNode [2024-11-09 18:02:24,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:02:24,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:02:24,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:02:24,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:02:24,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,046 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-09 18:02:24,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:02:24,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:02:24,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:02:24,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:02:24,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,072 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-09 18:02:24,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:02:24,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:02:24,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:02:24,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:02:24,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (1/1) ... [2024-11-09 18:02:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:02:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:24,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:02:24,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:02:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 18:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 18:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 18:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 18:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:02:24,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 18:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 18:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-09 18:02:24,166 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-09 18:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 18:02:24,232 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:02:24,234 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:02:24,391 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2024-11-09 18:02:24,430 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 18:02:24,430 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:02:24,443 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:02:24,443 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:02:24,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:02:24 BoogieIcfgContainer [2024-11-09 18:02:24,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:02:24,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:02:24,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:02:24,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:02:24,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:02:23" (1/3) ... [2024-11-09 18:02:24,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e8516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:24, skipping insertion in model container [2024-11-09 18:02:24,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:24" (2/3) ... [2024-11-09 18:02:24,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e8516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:24, skipping insertion in model container [2024-11-09 18:02:24,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:02:24" (3/3) ... [2024-11-09 18:02:24,451 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2024-11-09 18:02:24,466 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:02:24,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:02:24,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:02:24,553 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;@4c1fb874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:02:24,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:02:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 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-09 18:02:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:02:24,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:24,567 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-09 18:02:24,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:24,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1908990660, now seen corresponding path program 1 times [2024-11-09 18:02:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602502087] [2024-11-09 18:02:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 18:02:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 18:02:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 18:02:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:24,831 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-09 18:02:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602502087] [2024-11-09 18:02:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602502087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:02:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:02:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:02:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091568925] [2024-11-09 18:02:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:02:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:02:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:02:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:02:24,865 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-09 18:02:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:24,885 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-11-09 18:02:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:02:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-09 18:02:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:24,894 INFO L225 Difference]: With dead ends: 54 [2024-11-09 18:02:24,895 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 18:02:24,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:02:24,900 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:24,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 18:02:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 18:02:24,931 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-09 18:02:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-09 18:02:24,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-09 18:02:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:24,934 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-09 18:02:24,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-09 18:02:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-09 18:02:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 18:02:24,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:24,937 INFO L215 NwaCegarLoop]: trace histogram [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-09 18:02:24,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:02:24,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash 749000362, now seen corresponding path program 1 times [2024-11-09 18:02:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:24,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982745902] [2024-11-09 18:02:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 18:02:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 18:02:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 18:02:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 18:02:25,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:25,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982745902] [2024-11-09 18:02:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982745902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302388287] [2024-11-09 18:02:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:25,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:25,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:02:25,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:02:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:02:25,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 18:02:25,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:02:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302388287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:02:25,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:02:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 18:02:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907390340] [2024-11-09 18:02:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:02:25,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:02:25,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:25,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:02:25,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:02:25,327 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-09 18:02:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:25,344 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-11-09 18:02:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:02:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 34 [2024-11-09 18:02:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:25,347 INFO L225 Difference]: With dead ends: 48 [2024-11-09 18:02:25,347 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 18:02:25,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:02:25,349 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:25,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 18:02:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 18:02:25,358 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-09 18:02:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-09 18:02:25,360 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 34 [2024-11-09 18:02:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:25,361 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-09 18:02:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-09 18:02:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-09 18:02:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 18:02:25,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:25,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:25,378 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-09 18:02:25,565 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-09 18:02:25,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:25,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash 325830121, now seen corresponding path program 1 times [2024-11-09 18:02:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:25,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576094687] [2024-11-09 18:02:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 18:02:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 18:02:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 18:02:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 18:02:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576094687] [2024-11-09 18:02:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576094687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586424191] [2024-11-09 18:02:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:25,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:25,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:25,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:02:25,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 18:02:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:25,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:02:25,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:02:25,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:02:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586424191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:02:25,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:02:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-09 18:02:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533863794] [2024-11-09 18:02:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:02:25,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:02:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:25,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:02:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:02:25,878 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-09 18:02:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:25,898 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-11-09 18:02:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:02:25,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 36 [2024-11-09 18:02:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:25,903 INFO L225 Difference]: With dead ends: 50 [2024-11-09 18:02:25,903 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 18:02:25,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-09 18:02:25,905 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 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-09 18:02:25,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 18:02:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-09 18:02:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-09 18:02:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-09 18:02:25,915 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 36 [2024-11-09 18:02:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:25,915 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-09 18:02:25,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-09 18:02:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-09 18:02:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 18:02:25,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:25,918 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:25,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 18:02:26,118 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-09 18:02:26,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:26,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1445204300, now seen corresponding path program 1 times [2024-11-09 18:02:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:26,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110690342] [2024-11-09 18:02:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 18:02:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 18:02:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 18:02:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 18:02:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110690342] [2024-11-09 18:02:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110690342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79795143] [2024-11-09 18:02:26,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:26,228 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-09 18:02:26,232 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-09 18:02:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:02:26,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 18:02:26,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:02:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79795143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:02:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:02:26,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 18:02:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270823196] [2024-11-09 18:02:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:02:26,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:02:26,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:02:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:02:26,327 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-09 18:02:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:26,341 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-09 18:02:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:02:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 48 [2024-11-09 18:02:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:26,343 INFO L225 Difference]: With dead ends: 49 [2024-11-09 18:02:26,343 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 18:02:26,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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-09 18:02:26,344 INFO L432 NwaCegarLoop]: 30 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, 56 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-09 18:02:26,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 18:02:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 18:02:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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-09 18:02:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-09 18:02:26,355 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 48 [2024-11-09 18:02:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 18:02:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-09 18:02:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-09 18:02:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:02:26,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:26,361 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:26,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 18:02:26,561 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-09 18:02:26,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash -51485427, now seen corresponding path program 1 times [2024-11-09 18:02:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:26,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706484145] [2024-11-09 18:02:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 18:02:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 18:02:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 18:02:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 18:02:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706484145] [2024-11-09 18:02:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706484145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277443892] [2024-11-09 18:02:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:26,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:26,681 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-09 18:02:26,682 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-09 18:02:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:26,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:02:26,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 18:02:26,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 18:02:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277443892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:26,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-09 18:02:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237600711] [2024-11-09 18:02:26,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:02:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:02:26,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:02:26,881 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-09 18:02:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:26,930 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-09 18:02:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:02:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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 50 [2024-11-09 18:02:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:26,932 INFO L225 Difference]: With dead ends: 69 [2024-11-09 18:02:26,932 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 18:02:26,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 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-09 18:02:26,933 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 103 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-09 18:02:26,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 103 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 18:02:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-09 18:02:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-09 18:02:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-09 18:02:26,941 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 50 [2024-11-09 18:02:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:26,941 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-09 18:02:26,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-09 18:02:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-09 18:02:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 18:02:26,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:26,946 INFO L215 NwaCegarLoop]: trace histogram [9, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:26,959 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-09 18:02:27,146 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-09 18:02:27,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -408317715, now seen corresponding path program 2 times [2024-11-09 18:02:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497346534] [2024-11-09 18:02:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 18:02:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 18:02:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 18:02:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 18:02:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497346534] [2024-11-09 18:02:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497346534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418635076] [2024-11-09 18:02:27,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:02:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:27,329 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-09 18:02:27,330 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-09 18:02:27,419 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:02:27,420 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:02:27,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:02:27,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 18:02:27,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 18:02:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418635076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:27,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-09 18:02:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427860012] [2024-11-09 18:02:27,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:02:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:02:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:02:27,593 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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-09 18:02:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:27,652 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-11-09 18:02:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 18:02:27,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 68 [2024-11-09 18:02:27,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:27,654 INFO L225 Difference]: With dead ends: 89 [2024-11-09 18:02:27,654 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 18:02:27,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 136 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-09 18:02:27,655 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:27,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 18:02:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-09 18:02:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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-09 18:02:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-09 18:02:27,664 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 68 [2024-11-09 18:02:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-09 18:02:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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-09 18:02:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-09 18:02:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 18:02:27,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:27,666 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 10, 9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:27,685 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-09 18:02:27,870 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-09 18:02:27,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:27,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash 221063529, now seen corresponding path program 1 times [2024-11-09 18:02:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065409807] [2024-11-09 18:02:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 18:02:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 18:02:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 77 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 18:02:28,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065409807] [2024-11-09 18:02:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065409807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946970188] [2024-11-09 18:02:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:28,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:28,003 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-09 18:02:28,005 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-09 18:02:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:28,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:02:28,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-09 18:02:28,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-09 18:02:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946970188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:28,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:28,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 24 [2024-11-09 18:02:28,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865039116] [2024-11-09 18:02:28,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:28,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 18:02:28,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 18:02:28,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-09 18:02:28,507 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 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-09 18:02:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:28,575 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2024-11-09 18:02:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 18:02:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 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 92 [2024-11-09 18:02:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:28,577 INFO L225 Difference]: With dead ends: 114 [2024-11-09 18:02:28,577 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 18:02:28,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 170 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-09 18:02:28,579 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:28,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 18:02:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-09 18:02:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 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-09 18:02:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-09 18:02:28,596 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 92 [2024-11-09 18:02:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:28,597 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-09 18:02:28,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 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-09 18:02:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-09 18:02:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 18:02:28,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:28,601 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 12, 9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:28,618 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-09 18:02:28,801 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-09 18:02:28,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1803148030, now seen corresponding path program 1 times [2024-11-09 18:02:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69905943] [2024-11-09 18:02:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 18:02:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 18:02:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2024-11-09 18:02:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69905943] [2024-11-09 18:02:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69905943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240037088] [2024-11-09 18:02:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:29,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:29,014 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-09 18:02:29,016 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-09 18:02:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:02:29,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-09 18:02:29,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 8 proven. 116 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-09 18:02:29,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240037088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:29,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-09 18:02:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976353678] [2024-11-09 18:02:29,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 18:02:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 18:02:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:02:29,235 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-09 18:02:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:29,289 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2024-11-09 18:02:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 18:02:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 112 [2024-11-09 18:02:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:29,291 INFO L225 Difference]: With dead ends: 126 [2024-11-09 18:02:29,291 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 18:02:29,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:02:29,292 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:29,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 18:02:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 18:02:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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-09 18:02:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-09 18:02:29,309 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 112 [2024-11-09 18:02:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:29,309 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-09 18:02:29,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-09 18:02:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-09 18:02:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 18:02:29,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:29,313 INFO L215 NwaCegarLoop]: trace histogram [24, 21, 21, 21, 20, 18, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:29,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 18:02:29,513 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-09 18:02:29,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:29,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1715800373, now seen corresponding path program 2 times [2024-11-09 18:02:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:29,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695240725] [2024-11-09 18:02:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 18:02:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 18:02:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 20 proven. 536 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2024-11-09 18:02:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695240725] [2024-11-09 18:02:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695240725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867068992] [2024-11-09 18:02:29,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:02:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:29,870 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-09 18:02:29,872 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-09 18:02:30,018 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:02:30,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:02:30,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:02:30,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 428 proven. 78 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2024-11-09 18:02:30,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 20 proven. 536 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2024-11-09 18:02:30,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867068992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:30,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:30,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-09 18:02:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354316977] [2024-11-09 18:02:30,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:30,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:02:30,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:30,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:02:30,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:02:30,195 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 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-09 18:02:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:30,241 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2024-11-09 18:02:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:02:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 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 162 [2024-11-09 18:02:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:30,243 INFO L225 Difference]: With dead ends: 164 [2024-11-09 18:02:30,243 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 18:02:30,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:02:30,245 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:30,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 18:02:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 18:02:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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-09 18:02:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2024-11-09 18:02:30,263 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 162 [2024-11-09 18:02:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:30,264 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2024-11-09 18:02:30,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 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-09 18:02:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2024-11-09 18:02:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 18:02:30,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:30,266 INFO L215 NwaCegarLoop]: trace histogram [39, 36, 36, 33, 21, 20, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:30,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 18:02:30,466 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-09 18:02:30,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:30,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1799422138, now seen corresponding path program 3 times [2024-11-09 18:02:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103076016] [2024-11-09 18:02:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 18:02:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:30,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 18:02:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3180 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3174 trivial. 0 not checked. [2024-11-09 18:02:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103076016] [2024-11-09 18:02:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103076016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249265558] [2024-11-09 18:02:30,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 18:02:30,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:30,667 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-09 18:02:30,669 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-09 18:02:30,776 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 18:02:30,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:02:30,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:02:30,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3180 backedges. 257 proven. 3 refuted. 0 times theorem prover too weak. 2920 trivial. 0 not checked. [2024-11-09 18:02:30,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3180 backedges. 257 proven. 3 refuted. 0 times theorem prover too weak. 2920 trivial. 0 not checked. [2024-11-09 18:02:30,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249265558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:30,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:30,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 18:02:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064009920] [2024-11-09 18:02:30,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:30,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:02:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:02:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:02:30,871 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:02:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:30,931 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2024-11-09 18:02:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:02:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 222 [2024-11-09 18:02:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:30,933 INFO L225 Difference]: With dead ends: 202 [2024-11-09 18:02:30,933 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 18:02:30,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:02:30,934 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:30,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:02:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 18:02:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 18:02:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 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-09 18:02:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-09 18:02:30,950 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 222 [2024-11-09 18:02:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:30,950 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-09 18:02:30,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:02:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-09 18:02:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-09 18:02:30,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:30,957 INFO L215 NwaCegarLoop]: trace histogram [51, 48, 48, 33, 21, 20, 15, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 18:02:31,158 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-09 18:02:31,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:31,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash 399137475, now seen corresponding path program 4 times [2024-11-09 18:02:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:31,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272309134] [2024-11-09 18:02:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 18:02:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-09 18:02:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5238 trivial. 0 not checked. [2024-11-09 18:02:31,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:31,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272309134] [2024-11-09 18:02:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272309134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:31,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143236606] [2024-11-09 18:02:31,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 18:02:31,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:31,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:31,415 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-09 18:02:31,417 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-09 18:02:31,603 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 18:02:31,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:02:31,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 18:02:31,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 2186 proven. 512 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2024-11-09 18:02:31,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 2186 proven. 512 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2024-11-09 18:02:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143236606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:32,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 19] total 26 [2024-11-09 18:02:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319966357] [2024-11-09 18:02:32,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:32,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 18:02:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:32,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 18:02:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=405, Unknown=0, NotChecked=0, Total=650 [2024-11-09 18:02:32,225 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:02:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:32,321 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2024-11-09 18:02:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 18:02:32,322 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 272 [2024-11-09 18:02:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:32,323 INFO L225 Difference]: With dead ends: 238 [2024-11-09 18:02:32,323 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 18:02:32,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 516 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=405, Unknown=0, NotChecked=0, Total=650 [2024-11-09 18:02:32,324 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:32,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:02:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 18:02:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 18:02:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.082191780821918) internal successors, (158), 146 states have internal predecessors, (158), 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-09 18:02:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2024-11-09 18:02:32,332 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 272 [2024-11-09 18:02:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:32,333 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2024-11-09 18:02:32,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:02:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2024-11-09 18:02:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-09 18:02:32,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:32,337 INFO L215 NwaCegarLoop]: trace histogram [63, 60, 60, 33, 27, 21, 20, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:32,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 18:02:32,537 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-09 18:02:32,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash 595901580, now seen corresponding path program 5 times [2024-11-09 18:02:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549602957] [2024-11-09 18:02:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 18:02:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-09 18:02:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7898 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7878 trivial. 0 not checked. [2024-11-09 18:02:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549602957] [2024-11-09 18:02:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549602957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23290362] [2024-11-09 18:02:32,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 18:02:32,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:32,837 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-09 18:02:32,838 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-09 18:02:35,395 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2024-11-09 18:02:35,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:02:35,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:02:35,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7898 backedges. 3372 proven. 20 refuted. 0 times theorem prover too weak. 4506 trivial. 0 not checked. [2024-11-09 18:02:35,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7898 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7878 trivial. 0 not checked. [2024-11-09 18:02:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23290362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:35,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:35,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 18:02:35,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585179525] [2024-11-09 18:02:35,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:35,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:02:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:35,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:02:35,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:02:35,529 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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-09 18:02:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:35,555 INFO L93 Difference]: Finished difference Result 255 states and 283 transitions. [2024-11-09 18:02:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:02:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 322 [2024-11-09 18:02:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:35,557 INFO L225 Difference]: With dead ends: 255 [2024-11-09 18:02:35,557 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 18:02:35,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:02:35,558 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:35,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 18:02:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-09 18:02:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0759493670886076) internal successors, (170), 158 states have internal predecessors, (170), 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-09 18:02:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2024-11-09 18:02:35,566 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 322 [2024-11-09 18:02:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:35,567 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-11-09 18:02:35,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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-09 18:02:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2024-11-09 18:02:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-09 18:02:35,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:35,571 INFO L215 NwaCegarLoop]: trace histogram [63, 60, 60, 33, 27, 21, 20, 11, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:35,590 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-09 18:02:35,771 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-09 18:02:35,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:35,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1531685934, now seen corresponding path program 6 times [2024-11-09 18:02:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291395866] [2024-11-09 18:02:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 18:02:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 18:02:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-09 18:02:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:02:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7988 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 7878 trivial. 0 not checked. [2024-11-09 18:02:36,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:02:36,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291395866] [2024-11-09 18:02:36,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291395866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:02:36,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719060861] [2024-11-09 18:02:36,239 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 18:02:36,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:36,241 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-09 18:02:36,243 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-09 18:02:36,874 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2024-11-09 18:02:36,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:02:36,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:02:36,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:02:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7988 backedges. 3372 proven. 110 refuted. 0 times theorem prover too weak. 4506 trivial. 0 not checked. [2024-11-09 18:02:36,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:02:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7988 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 7878 trivial. 0 not checked. [2024-11-09 18:02:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719060861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:02:37,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:02:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2024-11-09 18:02:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445338598] [2024-11-09 18:02:37,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:02:37,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 18:02:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:02:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 18:02:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-09 18:02:37,144 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 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-09 18:02:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:02:37,180 INFO L93 Difference]: Finished difference Result 273 states and 304 transitions. [2024-11-09 18:02:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 18:02:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 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 334 [2024-11-09 18:02:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:02:37,183 INFO L225 Difference]: With dead ends: 273 [2024-11-09 18:02:37,183 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 18:02:37,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 662 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-09 18:02:37,184 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:02:37,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:02:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 18:02:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-09 18:02:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0681818181818181) internal successors, (188), 176 states have internal predecessors, (188), 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-09 18:02:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2024-11-09 18:02:37,193 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 334 [2024-11-09 18:02:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:02:37,194 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2024-11-09 18:02:37,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 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-09 18:02:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2024-11-09 18:02:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-09 18:02:37,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:02:37,198 INFO L215 NwaCegarLoop]: trace histogram [63, 60, 60, 33, 27, 21, 20, 20, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:02:37,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 18:02:37,399 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-09 18:02:37,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:02:37,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:02:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2086917083, now seen corresponding path program 7 times [2024-11-09 18:02:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:02:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745120763] [2024-11-09 18:02:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:02:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:02:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 18:02:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143348561] [2024-11-09 18:02:38,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 18:02:38,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:02:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:02:38,597 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-09 18:02:38,599 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-09 18:02:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:02:41,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:02:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:02:43,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:02:43,023 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:02:43,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:02:43,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 18:02:43,226 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-09 18:02:43,229 INFO L407 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1] [2024-11-09 18:02:43,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:02:43,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:02:43 BoogieIcfgContainer [2024-11-09 18:02:43,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:02:43,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:02:43,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:02:43,390 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:02:43,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:02:24" (3/4) ... [2024-11-09 18:02:43,393 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 18:02:43,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:02:43,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:02:43,531 INFO L158 Benchmark]: Toolchain (without parser) took 19781.02ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 102.7MB in the beginning and 137.8MB in the end (delta: -35.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 18:02:43,531 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:02:43,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.66ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 89.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:02:43,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:02:43,532 INFO L158 Benchmark]: Boogie Preprocessor took 36.00ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 85.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:02:43,532 INFO L158 Benchmark]: IcfgBuilder took 359.48ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 72.0MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:02:43,533 INFO L158 Benchmark]: TraceAbstraction took 18943.60ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 71.6MB in the beginning and 152.5MB in the end (delta: -80.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:02:43,533 INFO L158 Benchmark]: Witness Printer took 140.14ms. Allocated memory is still 216.0MB. Free memory was 152.5MB in the beginning and 137.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:02:43,535 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.10ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.66ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 89.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.00ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 85.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 359.48ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 72.0MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18943.60ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 71.6MB in the beginning and 152.5MB in the end (delta: -80.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 140.14ms. Allocated memory is still 216.0MB. Free memory was 152.5MB in the beginning and 137.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}] [L17] COND FALSE !(i < 20) VAL [x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=-2147483645, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483645, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483645, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=-4294967286, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967286, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967286, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=-6442450934, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-6442450934, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=-6442450934, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=-4294967288, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4294967288, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4294967288, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-2147483643, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-2147483643, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-2147483643, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=4, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=4, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=4, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=2147483649, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=2147483649, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=2147483649, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=2147483629, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483629, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483629, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-17, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-17, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-17, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3: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)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=-2147483645, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483645, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483645, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=-4294967286, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967286, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967286, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=-6442450934, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-6442450934, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=-6442450934, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=-4294967288, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4294967288, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4294967288, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-2147483643, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-2147483643, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-2147483643, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=4, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=4, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=4, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=2147483649, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=2147483649, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=2147483649, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=2147483629, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483629, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483629, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-17, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-17, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-17, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-1, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND FALSE !(i<20 -1) VAL [ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=-2147483641, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483641, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483641, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=-4294967289, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967289, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967289, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=-2147483643, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-2147483643, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=-2147483643, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=2, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=2, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=2, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=2147483649, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=2147483649, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=2147483649, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=4294967294, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=4294967294, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=4294967294, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=4294967274, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=4294967274, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=4294967274, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=2147483628, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483628, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483628, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-19, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-19, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-19, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-1, ret=-1, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 14, TraceHistogramMax: 63, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 1342 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 974 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 393 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 368 mSDtfsCounter, 393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3529 GetRequests, 3372 SyntacticMatches, 22 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=13, InterpolantAutomatonStates: 150, 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, 13 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 4237 NumberOfCodeBlocks, 3906 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 5133 ConstructedInterpolants, 0 QuantifiedInterpolants, 6155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4194 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 77717/80831 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-09 18:02:43,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE