./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/rangesum10.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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 02:30:18,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 02:30:18,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 02:30:18,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 02:30:18,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 02:30:18,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 02:30:18,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 02:30:18,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 02:30:18,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 02:30:18,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 02:30:18,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 02:30:18,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 02:30:18,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 02:30:18,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 02:30:18,504 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 02:30:18,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 02:30:18,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 02:30:18,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 02:30:18,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 02:30:18,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 02:30:18,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 02:30:18,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 02:30:18,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 02:30:18,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 02:30:18,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 02:30:18,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 02:30:18,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 02:30:18,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 02:30:18,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 02:30:18,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 02:30:18,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 02:30:18,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 02:30:18,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 02:30:18,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 02:30:18,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 02:30:18,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 02:30:18,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 02:30:18,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 02:30:18,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 02:30:18,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 02:30:18,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 02:30:18,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 02:30:18,513 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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2024-11-16 02:30:18,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 02:30:18,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 02:30:18,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 02:30:18,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 02:30:18,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 02:30:18,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-16 02:30:20,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 02:30:20,484 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 02:30:20,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-16 02:30:20,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0412e4169/cf095ecbe74747cc887e5056c775ddc5/FLAG030c9da85 [2024-11-16 02:30:20,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0412e4169/cf095ecbe74747cc887e5056c775ddc5 [2024-11-16 02:30:20,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 02:30:20,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 02:30:20,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 02:30:20,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 02:30:20,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 02:30:20,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3112c802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20, skipping insertion in model container [2024-11-16 02:30:20,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 02:30:20,780 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/rangesum10.i[1465,1478] [2024-11-16 02:30:20,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 02:30:20,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 02:30:20,838 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/rangesum10.i[1465,1478] [2024-11-16 02:30:20,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 02:30:20,860 INFO L204 MainTranslator]: Completed translation [2024-11-16 02:30:20,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20 WrapperNode [2024-11-16 02:30:20,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 02:30:20,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 02:30:20,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 02:30:20,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 02:30:20,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,895 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-16 02:30:20,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 02:30:20,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 02:30:20,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 02:30:20,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 02:30:20,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,929 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-16 02:30:20,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 02:30:20,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 02:30:20,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 02:30:20,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 02:30:20,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (1/1) ... [2024-11-16 02:30:20,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 02:30:20,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:20,988 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-16 02:30:20,991 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-16 02:30:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 02:30:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 02:30:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 02:30:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 02:30:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 02:30:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 02:30:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 02:30:21,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 02:30:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 02:30:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 02:30:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-16 02:30:21,046 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-16 02:30:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 02:30:21,115 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 02:30:21,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 02:30:21,219 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2024-11-16 02:30:21,273 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 02:30:21,273 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 02:30:21,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 02:30:21,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 02:30:21,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:30:21 BoogieIcfgContainer [2024-11-16 02:30:21,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 02:30:21,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 02:30:21,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 02:30:21,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 02:30:21,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:30:20" (1/3) ... [2024-11-16 02:30:21,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec961f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:30:21, skipping insertion in model container [2024-11-16 02:30:21,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:30:20" (2/3) ... [2024-11-16 02:30:21,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec961f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:30:21, skipping insertion in model container [2024-11-16 02:30:21,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:30:21" (3/3) ... [2024-11-16 02:30:21,303 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2024-11-16 02:30:21,323 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 02:30:21,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 02:30:21,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 02:30:21,397 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;@3774d465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 02:30:21,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 02:30:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:30:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 02:30:21,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:21,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:21,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1908990660, now seen corresponding path program 1 times [2024-11-16 02:30:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:21,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150676132] [2024-11-16 02:30:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 02:30:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 02:30:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 02:30:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,611 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-16 02:30:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150676132] [2024-11-16 02:30:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150676132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:30:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 02:30:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 02:30:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062070648] [2024-11-16 02:30:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:30:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 02:30:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 02:30:21,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 02:30:21,640 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 02:30:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:21,657 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-11-16 02:30:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 02:30:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-16 02:30:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:21,665 INFO L225 Difference]: With dead ends: 54 [2024-11-16 02:30:21,665 INFO L226 Difference]: Without dead ends: 25 [2024-11-16 02:30:21,668 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-16 02:30:21,671 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:21,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-16 02:30:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-16 02:30:21,704 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-16 02:30:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-16 02:30:21,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-16 02:30:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:21,706 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-16 02:30:21,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 02:30:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-16 02:30:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 02:30:21,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:21,709 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 02:30:21,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 749000362, now seen corresponding path program 1 times [2024-11-16 02:30:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972100697] [2024-11-16 02:30:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-16 02:30:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 02:30:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 02:30:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 02:30:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972100697] [2024-11-16 02:30:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972100697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689391379] [2024-11-16 02:30:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:21,901 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-16 02:30:21,905 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-16 02:30:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 02:30:22,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 02:30:22,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 02:30:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689391379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:30:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 02:30:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-16 02:30:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866522339] [2024-11-16 02:30:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:30:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 02:30:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 02:30:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 02:30:22,065 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 02:30:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:22,080 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-11-16 02:30:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 02:30:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-16 02:30:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:22,082 INFO L225 Difference]: With dead ends: 48 [2024-11-16 02:30:22,082 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 02:30:22,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 02:30:22,084 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:22,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 02:30:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 02:30:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:30:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-16 02:30:22,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 34 [2024-11-16 02:30:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:22,093 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-16 02:30:22,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 02:30:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-16 02:30:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 02:30:22,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:22,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:22,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 02:30:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:22,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 325830121, now seen corresponding path program 1 times [2024-11-16 02:30:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:22,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000184976] [2024-11-16 02:30:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 02:30:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 02:30:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 02:30:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 02:30:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000184976] [2024-11-16 02:30:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000184976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79251586] [2024-11-16 02:30:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:22,487 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-16 02:30:22,489 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-16 02:30:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 02:30:22,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 02:30:22,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 02:30:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79251586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:30:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 02:30:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-16 02:30:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540249708] [2024-11-16 02:30:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:30:22,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 02:30:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 02:30:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 02:30:22,578 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:30:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:22,593 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-11-16 02:30:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 02:30:22,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-16 02:30:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:22,594 INFO L225 Difference]: With dead ends: 50 [2024-11-16 02:30:22,594 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 02:30:22,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 02:30:22,596 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:22,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 02:30:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-16 02:30:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:30:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-16 02:30:22,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 36 [2024-11-16 02:30:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:22,602 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-16 02:30:22,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:30:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-16 02:30:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 02:30:22,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:22,605 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:22,622 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-16 02:30:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-16 02:30:22,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:22,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1445204300, now seen corresponding path program 1 times [2024-11-16 02:30:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873502330] [2024-11-16 02:30:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 02:30:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 02:30:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 02:30:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 02:30:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873502330] [2024-11-16 02:30:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873502330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587495112] [2024-11-16 02:30:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:22,952 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-16 02:30:22,953 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-16 02:30:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 02:30:23,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 02:30:23,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 02:30:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587495112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:30:23,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 02:30:23,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 02:30:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76602324] [2024-11-16 02:30:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:30:23,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 02:30:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 02:30:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 02:30:23,061 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:30:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:23,074 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-16 02:30:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 02:30:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-16 02:30:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:23,077 INFO L225 Difference]: With dead ends: 49 [2024-11-16 02:30:23,077 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 02:30:23,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 02:30:23,078 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:23,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 02:30:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 02:30:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:30:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-16 02:30:23,087 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 48 [2024-11-16 02:30:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:23,089 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-16 02:30:23,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:30:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-16 02:30:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 02:30:23,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:23,091 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:23,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 02:30:23,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:23,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:23,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:23,298 INFO L85 PathProgramCache]: Analyzing trace with hash -51485427, now seen corresponding path program 1 times [2024-11-16 02:30:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806588146] [2024-11-16 02:30:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:23,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 02:30:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 02:30:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 02:30:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 02:30:23,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806588146] [2024-11-16 02:30:23,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806588146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949679761] [2024-11-16 02:30:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:23,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:23,402 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-16 02:30:23,404 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-16 02:30:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 02:30:23,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-16 02:30:23,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:30:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-16 02:30:23,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949679761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:30:23,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:30:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-16 02:30:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776376308] [2024-11-16 02:30:23,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:30:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 02:30:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 02:30:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 02:30:23,622 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-16 02:30:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:23,672 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-16 02:30:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 02:30:23,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-16 02:30:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:23,673 INFO L225 Difference]: With dead ends: 69 [2024-11-16 02:30:23,674 INFO L226 Difference]: Without dead ends: 43 [2024-11-16 02:30:23,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 02:30:23,675 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:23,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 103 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-16 02:30:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-16 02:30:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:30:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-16 02:30:23,683 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 50 [2024-11-16 02:30:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-16 02:30:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-16 02:30:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-16 02:30:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 02:30:23,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:23,685 INFO L215 NwaCegarLoop]: trace histogram [9, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:23,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 02:30:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:23,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:23,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -408317715, now seen corresponding path program 2 times [2024-11-16 02:30:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684533980] [2024-11-16 02:30:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 02:30:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 02:30:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 02:30:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-16 02:30:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684533980] [2024-11-16 02:30:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684533980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32555055] [2024-11-16 02:30:24,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 02:30:24,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:24,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:24,039 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-16 02:30:24,041 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-16 02:30:24,130 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 02:30:24,131 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 02:30:24,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 02:30:24,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 02:30:24,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:30:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 02:30:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32555055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:30:24,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:30:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-16 02:30:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447954195] [2024-11-16 02:30:24,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:30:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 02:30:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 02:30:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 02:30:24,301 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 02:30:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:24,358 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-11-16 02:30:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 02:30:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-16 02:30:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:24,360 INFO L225 Difference]: With dead ends: 89 [2024-11-16 02:30:24,360 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 02:30:24,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 02:30:24,361 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:24,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 02:30:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-16 02:30:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:30:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-16 02:30:24,376 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 68 [2024-11-16 02:30:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:24,376 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-16 02:30:24,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 02:30:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-16 02:30:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 02:30:24,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:24,382 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 10, 9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:24,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 02:30:24,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:24,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:24,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:24,586 INFO L85 PathProgramCache]: Analyzing trace with hash 221063529, now seen corresponding path program 1 times [2024-11-16 02:30:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172829362] [2024-11-16 02:30:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 02:30:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 02:30:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 02:30:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 77 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 02:30:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:24,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172829362] [2024-11-16 02:30:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172829362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449612297] [2024-11-16 02:30:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:24,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:24,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:24,710 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-16 02:30:24,712 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-16 02:30:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:24,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 02:30:24,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-16 02:30:24,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:30:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 8 proven. 116 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-16 02:30:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449612297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:30:24,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:30:24,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-16 02:30:24,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131045772] [2024-11-16 02:30:24,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:30:24,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 02:30:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:24,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 02:30:24,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 02:30:24,944 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 02:30:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:25,069 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2024-11-16 02:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 02:30:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-11-16 02:30:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:25,070 INFO L225 Difference]: With dead ends: 108 [2024-11-16 02:30:25,071 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 02:30:25,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-16 02:30:25,072 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:25,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 02:30:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 02:30:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-16 02:30:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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-16 02:30:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-16 02:30:25,082 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 92 [2024-11-16 02:30:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-16 02:30:25,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 02:30:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-16 02:30:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 02:30:25,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:25,088 INFO L215 NwaCegarLoop]: trace histogram [24, 21, 21, 18, 11, 10, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:25,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 02:30:25,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:25,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:25,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 514819412, now seen corresponding path program 1 times [2024-11-16 02:30:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208117516] [2024-11-16 02:30:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 02:30:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 02:30:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 02:30:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1094 trivial. 0 not checked. [2024-11-16 02:30:25,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208117516] [2024-11-16 02:30:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208117516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104334218] [2024-11-16 02:30:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:25,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:25,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:25,447 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-16 02:30:25,450 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-16 02:30:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:25,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 02:30:25,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 454 proven. 98 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 02:30:25,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:30:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 556 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-16 02:30:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104334218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:30:25,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:30:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 14 [2024-11-16 02:30:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908165429] [2024-11-16 02:30:25,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:30:25,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 02:30:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 02:30:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 02:30:25,807 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 02:30:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:25,875 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2024-11-16 02:30:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 02:30:25,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 140 [2024-11-16 02:30:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:25,880 INFO L225 Difference]: With dead ends: 134 [2024-11-16 02:30:25,880 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 02:30:25,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 270 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 02:30:25,881 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:25,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 145 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 02:30:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 02:30:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-16 02:30:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 82 states have internal predecessors, (89), 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-16 02:30:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-16 02:30:25,895 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 140 [2024-11-16 02:30:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:25,898 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-16 02:30:25,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 02:30:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-16 02:30:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 02:30:25,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:25,900 INFO L215 NwaCegarLoop]: trace histogram [33, 30, 30, 18, 12, 11, 10, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:25,924 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-16 02:30:26,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:26,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:26,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1942734171, now seen corresponding path program 2 times [2024-11-16 02:30:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:26,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051571286] [2024-11-16 02:30:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 02:30:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 02:30:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 02:30:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-11-16 02:30:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051571286] [2024-11-16 02:30:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051571286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112522107] [2024-11-16 02:30:26,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 02:30:26,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:26,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 02:30:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 02:30:26,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 02:30:26,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 02:30:26,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 02:30:26,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 892 proven. 6 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-16 02:30:26,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:30:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-11-16 02:30:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112522107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:30:26,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:30:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-16 02:30:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089107150] [2024-11-16 02:30:26,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:30:26,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 02:30:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:26,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 02:30:26,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-16 02:30:26,530 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 02:30:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:26,548 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2024-11-16 02:30:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 02:30:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 178 [2024-11-16 02:30:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:26,551 INFO L225 Difference]: With dead ends: 147 [2024-11-16 02:30:26,551 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 02:30:26,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-16 02:30:26,552 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:30:26,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 02:30:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-16 02:30:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0777777777777777) internal successors, (97), 90 states have internal predecessors, (97), 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-16 02:30:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-16 02:30:26,563 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 178 [2024-11-16 02:30:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:26,564 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-16 02:30:26,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 02:30:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-16 02:30:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 02:30:26,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:26,566 INFO L215 NwaCegarLoop]: trace histogram [33, 30, 30, 18, 12, 11, 10, 7, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:26,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 02:30:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 02:30:26,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2090673119, now seen corresponding path program 3 times [2024-11-16 02:30:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138485792] [2024-11-16 02:30:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 02:30:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 02:30:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-16 02:30:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:30:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2090 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-11-16 02:30:27,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:30:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138485792] [2024-11-16 02:30:27,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138485792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:30:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651379850] [2024-11-16 02:30:27,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 02:30:27,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:27,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:27,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 02:30:27,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 02:30:27,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-16 02:30:27,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 02:30:27,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 02:30:27,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:30:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2090 backedges. 892 proven. 42 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-16 02:30:27,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:30:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2090 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-11-16 02:30:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651379850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:30:27,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:30:27,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-16 02:30:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364934764] [2024-11-16 02:30:27,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:30:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 02:30:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:30:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 02:30:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-16 02:30:27,377 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 02:30:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:30:27,408 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2024-11-16 02:30:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 02:30:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2024-11-16 02:30:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:30:27,410 INFO L225 Difference]: With dead ends: 153 [2024-11-16 02:30:27,411 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 02:30:27,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 370 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-16 02:30:27,412 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 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-16 02:30:27,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:30:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 02:30:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-16 02:30:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 96 states have internal predecessors, (103), 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-16 02:30:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-16 02:30:27,420 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 186 [2024-11-16 02:30:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:30:27,421 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-16 02:30:27,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 02:30:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-16 02:30:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 02:30:27,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:30:27,423 INFO L215 NwaCegarLoop]: trace histogram [33, 30, 30, 18, 12, 11, 10, 10, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:30:27,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-16 02:30:27,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 02:30:27,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:30:27,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:30:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1384263134, now seen corresponding path program 4 times [2024-11-16 02:30:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:30:27,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047398606] [2024-11-16 02:30:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:30:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:30:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 02:30:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024247962] [2024-11-16 02:30:27,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 02:30:27,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:30:27,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:30:27,939 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 02:30:27,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 02:30:28,320 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 02:30:28,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 02:30:28,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 02:30:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 02:30:28,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 02:30:28,677 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 02:30:28,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 02:30:28,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-16 02:30:28,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 02:30:28,886 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2024-11-16 02:30:29,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 02:30:29,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:30:29 BoogieIcfgContainer [2024-11-16 02:30:29,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 02:30:29,010 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 02:30:29,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 02:30:29,010 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 02:30:29,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:30:21" (3/4) ... [2024-11-16 02:30:29,013 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 02:30:29,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 02:30:29,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 02:30:29,127 INFO L158 Benchmark]: Toolchain (without parser) took 8610.73ms. Allocated memory was 172.0MB in the beginning and 272.6MB in the end (delta: 100.7MB). Free memory was 108.1MB in the beginning and 190.2MB in the end (delta: -82.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,127 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.2MB in the beginning and 50.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 02:30:29,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.92ms. Allocated memory is still 172.0MB. Free memory was 107.7MB in the beginning and 141.6MB in the end (delta: -33.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.37ms. Allocated memory is still 172.0MB. Free memory was 141.6MB in the beginning and 140.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,128 INFO L158 Benchmark]: Boogie Preprocessor took 53.62ms. Allocated memory is still 172.0MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,128 INFO L158 Benchmark]: IcfgBuilder took 339.29ms. Allocated memory is still 172.0MB. Free memory was 138.0MB in the beginning and 124.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,128 INFO L158 Benchmark]: TraceAbstraction took 7717.08ms. Allocated memory was 172.0MB in the beginning and 272.6MB in the end (delta: 100.7MB). Free memory was 124.1MB in the beginning and 198.6MB in the end (delta: -74.6MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,128 INFO L158 Benchmark]: Witness Printer took 116.50ms. Allocated memory is still 272.6MB. Free memory was 198.6MB in the beginning and 190.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 02:30:29,131 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.17ms. Allocated memory is still 96.5MB. Free memory was 50.2MB in the beginning and 50.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.92ms. Allocated memory is still 172.0MB. Free memory was 107.7MB in the beginning and 141.6MB in the end (delta: -33.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.37ms. Allocated memory is still 172.0MB. Free memory was 141.6MB in the beginning and 140.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.62ms. Allocated memory is still 172.0MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 339.29ms. Allocated memory is still 172.0MB. Free memory was 138.0MB in the beginning and 124.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7717.08ms. Allocated memory was 172.0MB in the beginning and 272.6MB in the end (delta: 100.7MB). Free memory was 124.1MB in the beginning and 198.6MB in the end (delta: -74.6MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 116.50ms. Allocated memory is still 272.6MB. Free memory was 198.6MB in the beginning and 190.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND FALSE !(i < 10) VAL [x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-38, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-38, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-38, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-15, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-15, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-15, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-38, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-38, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-38, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-15, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-15, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-15, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-3, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-3, ret=-3, temp=22, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [ret2=-3, ret=-3, temp=22, x={3:0}] [L57] x[10 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-37, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-37, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-37, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-14, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-14, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-14, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=8, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=8, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=8, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=2, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-3, ret=-3, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 702 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 288 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1658 GetRequests, 1573 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=10, InterpolantAutomatonStates: 77, 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, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2077 NumberOfCodeBlocks, 1995 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2382 ConstructedInterpolants, 0 QuantifiedInterpolants, 2882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2361 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 16355/17459 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-16 02:30:29,170 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