./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum.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 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 09:51:52,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 09:51:52,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 09:51:52,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 09:51:52,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 09:51:53,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 09:51:53,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 09:51:53,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 09:51:53,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 09:51:53,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 09:51:53,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 09:51:53,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 09:51:53,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 09:51:53,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 09:51:53,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 09:51:53,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 09:51:53,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 09:51:53,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 09:51:53,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 09:51:53,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 09:51:53,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 09:51:53,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 09:51:53,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 09:51:53,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 09:51:53,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 09:51:53,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 09:51:53,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 09:51:53,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 09:51:53,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 09:51:53,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 09:51:53,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 09:51:53,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 09:51:53,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:51:53,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 09:51:53,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 09:51:53,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 09:51:53,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 09:51:53,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 09:51:53,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 09:51:53,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 09:51:53,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 09:51:53,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 09:51:53,047 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 -> 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 [2024-11-08 09:51:53,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 09:51:53,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 09:51:53,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 09:51:53,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 09:51:53,412 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 09:51:53,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2024-11-08 09:51:54,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 09:51:55,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 09:51:55,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2024-11-08 09:51:55,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d8d9e5f/c461ebe60bd04a9cbda3d1bc2beb0b4c/FLAGe1fe78cdc [2024-11-08 09:51:55,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d8d9e5f/c461ebe60bd04a9cbda3d1bc2beb0b4c [2024-11-08 09:51:55,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 09:51:55,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 09:51:55,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 09:51:55,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 09:51:55,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 09:51:55,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d20b2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55, skipping insertion in model container [2024-11-08 09:51:55,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 09:51:55,378 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/rangesum.i[1544,1557] [2024-11-08 09:51:55,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:51:55,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 09:51:55,409 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/rangesum.i[1544,1557] [2024-11-08 09:51:55,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:51:55,427 INFO L204 MainTranslator]: Completed translation [2024-11-08 09:51:55,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55 WrapperNode [2024-11-08 09:51:55,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 09:51:55,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 09:51:55,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 09:51:55,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 09:51:55,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,468 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-11-08 09:51:55,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 09:51:55,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 09:51:55,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 09:51:55,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 09:51:55,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,503 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-08 09:51:55,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 09:51:55,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 09:51:55,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 09:51:55,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 09:51:55,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (1/1) ... [2024-11-08 09:51:55,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:51:55,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:51:55,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 09:51:55,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 09:51:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 09:51:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 09:51:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 09:51:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 09:51:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 09:51:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 09:51:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 09:51:55,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 09:51:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 09:51:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 09:51:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-08 09:51:55,618 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-08 09:51:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 09:51:55,722 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 09:51:55,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 09:51:55,977 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 09:51:55,981 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 09:51:55,997 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 09:51:55,998 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 09:51:55,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:51:55 BoogieIcfgContainer [2024-11-08 09:51:55,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 09:51:56,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 09:51:56,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 09:51:56,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 09:51:56,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:51:55" (1/3) ... [2024-11-08 09:51:56,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9b9ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:51:56, skipping insertion in model container [2024-11-08 09:51:56,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:51:55" (2/3) ... [2024-11-08 09:51:56,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9b9ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:51:56, skipping insertion in model container [2024-11-08 09:51:56,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:51:55" (3/3) ... [2024-11-08 09:51:56,010 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum.i [2024-11-08 09:51:56,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 09:51:56,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 09:51:56,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 09:51:56,099 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;@23d118e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 09:51:56,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 09:51:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 09:51:56,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:56,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:51:56,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:56,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2094119026, now seen corresponding path program 1 times [2024-11-08 09:51:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785713443] [2024-11-08 09:51:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 09:51:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 09:51:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 09:51:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:51:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785713443] [2024-11-08 09:51:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785713443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:51:56,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:51:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 09:51:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998186002] [2024-11-08 09:51:56,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:51:56,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 09:51:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 09:51:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 09:51:56,404 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 09:51:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:56,421 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2024-11-08 09:51:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 09:51:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 30 [2024-11-08 09:51:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:56,428 INFO L225 Difference]: With dead ends: 55 [2024-11-08 09:51:56,428 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 09:51:56,430 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-08 09:51:56,433 INFO L432 NwaCegarLoop]: 37 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, 37 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-08 09:51:56,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:51:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 09:51:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-08 09:51:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-08 09:51:56,466 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 30 [2024-11-08 09:51:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:56,466 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-08 09:51:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 09:51:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-08 09:51:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 09:51:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:56,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:51:56,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 09:51:56,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:56,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2142996165, now seen corresponding path program 1 times [2024-11-08 09:51:56,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:56,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247493511] [2024-11-08 09:51:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 09:51:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 09:51:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 09:51:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:51:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:56,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247493511] [2024-11-08 09:51:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247493511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:51:56,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:51:56,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 09:51:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100848700] [2024-11-08 09:51:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:51:56,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:51:56,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:56,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:51:56,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:51:56,763 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 09:51:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:56,808 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-08 09:51:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:51:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 30 [2024-11-08 09:51:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:56,811 INFO L225 Difference]: With dead ends: 47 [2024-11-08 09:51:56,811 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 09:51:56,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:51:56,813 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:51:56,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:51:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 09:51:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-08 09:51:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-08 09:51:56,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 30 [2024-11-08 09:51:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:56,828 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-08 09:51:56,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 09:51:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-08 09:51:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 09:51:56,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:56,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:51:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 09:51:56,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:56,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1157460697, now seen corresponding path program 1 times [2024-11-08 09:51:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:56,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189287064] [2024-11-08 09:51:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 09:51:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 09:51:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 09:51:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 09:51:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189287064] [2024-11-08 09:51:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189287064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:51:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266246190] [2024-11-08 09:51:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:51:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:51:57,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:51:57,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 09:51:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 09:51:57,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:51:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 09:51:57,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:51:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266246190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:51:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:51:57,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-08 09:51:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043601426] [2024-11-08 09:51:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:51:57,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:51:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:51:57,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 09:51:57,256 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:51:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:57,271 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-11-08 09:51:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:51:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 32 [2024-11-08 09:51:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:57,289 INFO L225 Difference]: With dead ends: 48 [2024-11-08 09:51:57,289 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 09:51:57,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 09:51:57,291 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:51:57,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:51:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 09:51:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 09:51:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 09:51:57,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 32 [2024-11-08 09:51:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:57,301 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 09:51:57,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:51:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 09:51:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 09:51:57,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:57,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:51:57,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 09:51:57,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:51:57,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:57,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash 655585368, now seen corresponding path program 1 times [2024-11-08 09:51:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:57,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006848192] [2024-11-08 09:51:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 09:51:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 09:51:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 09:51:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 09:51:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006848192] [2024-11-08 09:51:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006848192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:51:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335393726] [2024-11-08 09:51:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:57,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:51:57,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:51:57,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:51:57,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 09:51:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:57,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:51:57,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:51:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:51:57,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:51:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:51:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335393726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:51:57,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:51:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-08 09:51:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004734916] [2024-11-08 09:51:57,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:51:57,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 09:51:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:57,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 09:51:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 09:51:57,870 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:51:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:58,025 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2024-11-08 09:51:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 09:51:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2024-11-08 09:51:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:58,027 INFO L225 Difference]: With dead ends: 60 [2024-11-08 09:51:58,027 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 09:51:58,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:51:58,031 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:51:58,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 90 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:51:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 09:51:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 09:51:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-08 09:51:58,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 32 [2024-11-08 09:51:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:58,043 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-08 09:51:58,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:51:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-08 09:51:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 09:51:58,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:58,046 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 09:51:58,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 09:51:58,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 09:51:58,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash -639666182, now seen corresponding path program 1 times [2024-11-08 09:51:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:58,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394937467] [2024-11-08 09:51:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:51:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 09:51:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 09:51:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-08 09:51:58,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394937467] [2024-11-08 09:51:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394937467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:51:58,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:51:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 09:51:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849028449] [2024-11-08 09:51:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:51:58,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 09:51:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 09:51:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 09:51:58,358 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:51:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:58,396 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-08 09:51:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 09:51:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-08 09:51:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:58,397 INFO L225 Difference]: With dead ends: 55 [2024-11-08 09:51:58,397 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 09:51:58,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 09:51:58,398 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 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-08 09:51:58,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:51:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 09:51:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-08 09:51:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-08 09:51:58,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 43 [2024-11-08 09:51:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:58,405 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-08 09:51:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:51:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-08 09:51:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 09:51:58,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:58,407 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-08 09:51:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 09:51:58,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:58,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash 121342172, now seen corresponding path program 1 times [2024-11-08 09:51:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352754066] [2024-11-08 09:51:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:51:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 09:51:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 09:51:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 09:51:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352754066] [2024-11-08 09:51:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352754066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:51:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:51:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 09:51:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381457514] [2024-11-08 09:51:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:51:58,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 09:51:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 09:51:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 09:51:58,673 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:58,748 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-08 09:51:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 09:51:58,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 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) Word has length 45 [2024-11-08 09:51:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:58,752 INFO L225 Difference]: With dead ends: 59 [2024-11-08 09:51:58,753 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 09:51:58,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:51:58,754 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:51:58,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 231 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:51:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 09:51:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-08 09:51:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-08 09:51:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-11-08 09:51:58,765 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 45 [2024-11-08 09:51:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-11-08 09:51:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 09:51:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-11-08 09:51:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 09:51:58,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:58,767 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:51:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 09:51:58,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1303372657, now seen corresponding path program 1 times [2024-11-08 09:51:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557203928] [2024-11-08 09:51:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:51:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 09:51:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 09:51:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 09:51:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557203928] [2024-11-08 09:51:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557203928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:51:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858678769] [2024-11-08 09:51:58,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:58,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:51:58,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:51:58,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:51:58,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 09:51:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:59,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:51:59,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:51:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:51:59,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:51:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 09:51:59,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858678769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:51:59,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:51:59,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-08 09:51:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333466364] [2024-11-08 09:51:59,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:51:59,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 09:51:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:51:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 09:51:59,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 09:51:59,265 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:51:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:51:59,348 INFO L93 Difference]: Finished difference Result 84 states and 120 transitions. [2024-11-08 09:51:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 09:51:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-08 09:51:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:51:59,350 INFO L225 Difference]: With dead ends: 84 [2024-11-08 09:51:59,350 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 09:51:59,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:51:59,355 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:51:59,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:51:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 09:51:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-08 09:51:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-08 09:51:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-08 09:51:59,369 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 48 [2024-11-08 09:51:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:51:59,370 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-08 09:51:59,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:51:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-08 09:51:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 09:51:59,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:51:59,373 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:51:59,393 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-08 09:51:59,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:51:59,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:51:59,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:51:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash 729051389, now seen corresponding path program 2 times [2024-11-08 09:51:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:51:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140885540] [2024-11-08 09:51:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:51:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:51:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:51:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 09:51:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:59,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 09:51:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:51:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 09:51:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:51:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140885540] [2024-11-08 09:51:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140885540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:51:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922330348] [2024-11-08 09:51:59,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:51:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:51:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:51:59,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:51:59,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 09:51:59,852 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:51:59,852 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:51:59,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 09:51:59,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:51:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 09:51:59,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 09:52:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922330348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:00,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2024-11-08 09:52:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528950438] [2024-11-08 09:52:00,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 09:52:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:00,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 09:52:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-08 09:52:00,126 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:52:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:00,319 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2024-11-08 09:52:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 09:52:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2024-11-08 09:52:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:00,321 INFO L225 Difference]: With dead ends: 130 [2024-11-08 09:52:00,321 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 09:52:00,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-08 09:52:00,322 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:00,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 229 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 09:52:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-08 09:52:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-08 09:52:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2024-11-08 09:52:00,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 57 [2024-11-08 09:52:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:00,341 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2024-11-08 09:52:00,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:52:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-11-08 09:52:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 09:52:00,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:00,342 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1] [2024-11-08 09:52:00,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:00,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:00,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 619340959, now seen corresponding path program 3 times [2024-11-08 09:52:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6707741] [2024-11-08 09:52:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 09:52:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 09:52:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 09:52:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 09:52:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6707741] [2024-11-08 09:52:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6707741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134362118] [2024-11-08 09:52:00,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 09:52:00,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:00,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:00,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:00,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 09:52:00,824 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 09:52:00,825 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:52:00,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 09:52:00,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 51 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 09:52:00,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 51 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 09:52:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134362118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:01,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2024-11-08 09:52:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453819127] [2024-11-08 09:52:01,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:01,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 09:52:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 09:52:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-08 09:52:01,127 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 09:52:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:01,260 INFO L93 Difference]: Finished difference Result 121 states and 165 transitions. [2024-11-08 09:52:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 09:52:01,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-11-08 09:52:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:01,262 INFO L225 Difference]: With dead ends: 121 [2024-11-08 09:52:01,262 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 09:52:01,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-11-08 09:52:01,263 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:01,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 62 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 09:52:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2024-11-08 09:52:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-08 09:52:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-08 09:52:01,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 59 [2024-11-08 09:52:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-08 09:52:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 09:52:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-08 09:52:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 09:52:01,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:01,283 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:01,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 09:52:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:01,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 433918235, now seen corresponding path program 1 times [2024-11-08 09:52:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086187247] [2024-11-08 09:52:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:01,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 09:52:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 09:52:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 09:52:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-08 09:52:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:52:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086187247] [2024-11-08 09:52:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086187247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:52:01,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102429870] [2024-11-08 09:52:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:01,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:01,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 09:52:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:52:01,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 09:52:01,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:52:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-08 09:52:01,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:52:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-08 09:52:01,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102429870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:52:01,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:52:01,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-08 09:52:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730251809] [2024-11-08 09:52:01,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:52:01,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 09:52:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:52:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 09:52:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 09:52:01,977 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:52:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:52:02,095 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-08 09:52:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 09:52:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2024-11-08 09:52:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:52:02,097 INFO L225 Difference]: With dead ends: 78 [2024-11-08 09:52:02,097 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 09:52:02,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-08 09:52:02,098 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:52:02,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:52:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 09:52:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-08 09:52:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-08 09:52:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-11-08 09:52:02,105 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 65 [2024-11-08 09:52:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:52:02,106 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-08 09:52:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 09:52:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-11-08 09:52:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 09:52:02,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:52:02,107 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 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] [2024-11-08 09:52:02,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:02,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:02,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:52:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:52:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1262430211, now seen corresponding path program 2 times [2024-11-08 09:52:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:52:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566466320] [2024-11-08 09:52:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:52:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:52:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 09:52:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917998329] [2024-11-08 09:52:02,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:52:02,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:02,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:52:02,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:52:02,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 09:52:02,517 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:52:02,517 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 09:52:02,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 09:52:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 09:52:02,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 09:52:02,724 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 09:52:02,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 09:52:02,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 09:52:02,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:52:02,935 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 09:52:02,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 09:52:02,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:52:02 BoogieIcfgContainer [2024-11-08 09:52:02,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 09:52:02,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 09:52:02,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 09:52:02,994 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 09:52:02,995 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:51:55" (3/4) ... [2024-11-08 09:52:02,995 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 09:52:03,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 09:52:03,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 09:52:03,061 INFO L158 Benchmark]: Toolchain (without parser) took 7929.93ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 149.1MB in the beginning and 73.9MB in the end (delta: 75.3MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,061 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 09:52:03,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.88ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 142.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.38ms. Allocated memory is still 182.5MB. Free memory was 142.0MB in the beginning and 140.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,065 INFO L158 Benchmark]: Boogie Preprocessor took 50.32ms. Allocated memory is still 182.5MB. Free memory was 140.1MB in the beginning and 138.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,065 INFO L158 Benchmark]: RCFGBuilder took 479.47ms. Allocated memory is still 182.5MB. Free memory was 138.1MB in the beginning and 144.5MB in the end (delta: -6.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,065 INFO L158 Benchmark]: TraceAbstraction took 6992.41ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 144.2MB in the beginning and 79.1MB in the end (delta: 65.1MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,066 INFO L158 Benchmark]: Witness Printer took 66.11ms. Allocated memory is still 220.2MB. Free memory was 78.0MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 09:52:03,067 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.20ms. Allocated memory is still 182.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.88ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 142.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.38ms. Allocated memory is still 182.5MB. Free memory was 142.0MB in the beginning and 140.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.32ms. Allocated memory is still 182.5MB. Free memory was 140.1MB in the beginning and 138.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.47ms. Allocated memory is still 182.5MB. Free memory was 138.1MB in the beginning and 144.5MB in the end (delta: -6.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6992.41ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 144.2MB in the beginning and 79.1MB in the end (delta: 65.1MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 66.11ms. Allocated memory is still 220.2MB. Free memory was 78.0MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 64]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] int N; VAL [N=0] [L43] N = __VERIFIER_nondet_int() [L44] COND TRUE N > 1 [L45] int x[N]; [L46] CALL init_nondet(x) [L17] int i; [L18] i = 0 VAL [N=3, i=0, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=1, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=2, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=3, x={3:0}] [L18] COND FALSE !(i < N) VAL [N=3, x={3:0}] [L46] RET init_nondet(x) [L47] int temp; [L48] int ret; [L49] int ret2; [L50] int ret5; VAL [N=3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=1, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=1, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=1, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=1, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [N=3, x={3:0}] [L52] ret = rangesum(x) [L54] EXPR x[0] [L54] temp=x[0] [L54] EXPR x[1] [L54] x[0] = x[1] [L54] x[1] = temp VAL [N=3] [L55] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=1, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=1, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=1, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=1, x={3:0}] [L55] RET, EXPR rangesum(x) VAL [N=3, ret=1, x={3:0}] [L55] ret2 = rangesum(x) [L56] EXPR x[0] [L56] temp=x[0] [L57] int i =0 ; VAL [N=3, i=0, ret2=1, ret=1, temp=2, x={3:0}] [L57] COND TRUE i N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=2, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=2, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=2, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=2, x={3:0}] [L61] RET, EXPR rangesum(x) VAL [N=3, ret2=1, ret=1, x={3:0}] [L61] ret5 = rangesum(x) [L63] COND TRUE ret != ret2 || ret !=ret5 VAL [N=3, x={3:0}] [L64] reach_error() VAL [N=3, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 962 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 697 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 265 mSDtfsCounter, 795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 583 SyntacticMatches, 18 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=8, InterpolantAutomatonStates: 76, 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, 10 MinimizatonAttempts, 35 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 868 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 1908 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1102 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 1214/1454 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 09:52:03,104 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