./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2b1e7360b510ceea1b4f190c67c2656c6deb0030b7718750b71696817135287b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:05:21,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:05:21,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:05:21,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:05:21,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:05:21,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:05:21,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:05:21,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:05:21,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:05:21,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:05:21,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:05:21,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:05:21,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:05:21,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:05:21,511 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:05:21,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:05:21,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:05:21,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:05:21,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:05:21,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:05:21,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:05:21,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:05:21,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:05:21,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:05:21,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:05:21,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:05:21,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:05:21,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:05:21,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:05:21,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:05:21,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:05:21,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:05:21,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:05:21,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:05:21,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:05:21,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:05:21,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:05:21,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:05:21,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:05:21,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:05:21,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:05:21,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:05:21,519 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-clean/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-clean/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 -> 2b1e7360b510ceea1b4f190c67c2656c6deb0030b7718750b71696817135287b [2024-10-11 03:05:21,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:05:21,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:05:21,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:05:21,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:05:21,729 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:05:21,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2024-10-11 03:05:22,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:05:23,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:05:23,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2024-10-11 03:05:23,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f832ffec/7de9cfdde6e34426926d15ecdc468eb2/FLAGb8dcece37 [2024-10-11 03:05:23,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f832ffec/7de9cfdde6e34426926d15ecdc468eb2 [2024-10-11 03:05:23,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:05:23,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:05:23,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:05:23,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:05:23,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:05:23,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a095263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23, skipping insertion in model container [2024-10-11 03:05:23,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:05:23,278 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c[481,494] [2024-10-11 03:05:23,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:05:23,292 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:05:23,304 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c[481,494] [2024-10-11 03:05:23,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:05:23,316 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:05:23,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23 WrapperNode [2024-10-11 03:05:23,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:05:23,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:05:23,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:05:23,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:05:23,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,338 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-10-11 03:05:23,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:05:23,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:05:23,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:05:23,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:05:23,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,374 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:05:23,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:05:23,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:05:23,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:05:23,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:05:23,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (1/1) ... [2024-10-11 03:05:23,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:05:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:23,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:05:23,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:05:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:05:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:05:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:05:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-11 03:05:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-11 03:05:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:05:23,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:05:23,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:05:23,581 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 03:05:23,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:05:23,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:05:23,599 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:05:23,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:05:23 BoogieIcfgContainer [2024-10-11 03:05:23,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:05:23,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:05:23,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:05:23,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:05:23,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:05:23" (1/3) ... [2024-10-11 03:05:23,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e8c2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:05:23, skipping insertion in model container [2024-10-11 03:05:23,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:23" (2/3) ... [2024-10-11 03:05:23,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e8c2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:05:23, skipping insertion in model container [2024-10-11 03:05:23,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:05:23" (3/3) ... [2024-10-11 03:05:23,605 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2024-10-11 03:05:23,618 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:05:23,618 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:05:23,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:05:23,662 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;@67b5736c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:05:23,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:05:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:05:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:05:23,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:23,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:23,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-10-11 03:05:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:23,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043030399] [2024-10-11 03:05:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:05:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043030399] [2024-10-11 03:05:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043030399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:05:23,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:05:23,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:05:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599582792] [2024-10-11 03:05:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:05:23,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:05:23,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:23,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:05:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:05:23,982 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:05:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:24,053 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-10-11 03:05:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:05:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 03:05:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:24,062 INFO L225 Difference]: With dead ends: 22 [2024-10-11 03:05:24,062 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 03:05:24,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:05:24,068 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:24,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:05:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 03:05:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 03:05:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 03:05:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-11 03:05:24,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-10-11 03:05:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:24,101 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-11 03:05:24,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:05:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-11 03:05:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 03:05:24,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:24,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:24,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:05:24,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:24,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-10-11 03:05:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060539038] [2024-10-11 03:05:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:05:24,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060539038] [2024-10-11 03:05:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060539038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422200113] [2024-10-11 03:05:24,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:24,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:24,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:24,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:24,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:05:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:05:24,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:05:24,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:05:24,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422200113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:24,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:24,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-10-11 03:05:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028849006] [2024-10-11 03:05:24,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:24,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:05:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:05:24,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:05:24,577 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 03:05:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:24,629 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-11 03:05:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:05:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 15 [2024-10-11 03:05:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:24,631 INFO L225 Difference]: With dead ends: 21 [2024-10-11 03:05:24,631 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 03:05:24,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:05:24,632 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:24,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 03:05:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 03:05:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:05:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-11 03:05:24,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-10-11 03:05:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:24,638 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-11 03:05:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 03:05:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-10-11 03:05:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 03:05:24,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:24,639 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:24,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:05:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:24,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2024-10-11 03:05:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375511375] [2024-10-11 03:05:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:05:25,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375511375] [2024-10-11 03:05:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375511375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788464670] [2024-10-11 03:05:25,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:05:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:25,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:05:25,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:05:25,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:25,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:05:25,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:05:25,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:05:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788464670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:25,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-10-11 03:05:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120720501] [2024-10-11 03:05:25,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:25,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:05:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:05:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:05:25,374 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 03:05:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:25,417 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-11 03:05:25,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:05:25,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 21 [2024-10-11 03:05:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:25,418 INFO L225 Difference]: With dead ends: 24 [2024-10-11 03:05:25,418 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 03:05:25,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:05:25,419 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:25,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 03:05:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 03:05:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:05:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-11 03:05:25,423 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2024-10-11 03:05:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:25,424 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-11 03:05:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 03:05:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-11 03:05:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 03:05:25,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:25,425 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:25,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:05:25,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:25,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:25,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2024-10-11 03:05:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712569999] [2024-10-11 03:05:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:05:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:25,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712569999] [2024-10-11 03:05:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712569999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:25,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527831153] [2024-10-11 03:05:25,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:05:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:25,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:25,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:05:25,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 03:05:25,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:25,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:05:25,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:05:25,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:05:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527831153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:26,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:26,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-10-11 03:05:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199218572] [2024-10-11 03:05:26,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:05:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:05:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:05:26,270 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-11 03:05:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:26,347 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-11 03:05:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:05:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 27 [2024-10-11 03:05:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:26,349 INFO L225 Difference]: With dead ends: 27 [2024-10-11 03:05:26,349 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 03:05:26,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:05:26,350 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:26,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:05:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 03:05:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 03:05:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:05:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-11 03:05:26,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2024-10-11 03:05:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-11 03:05:26,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-11 03:05:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-11 03:05:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 03:05:26,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:26,361 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:26,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:05:26,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:26,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:26,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2024-10-11 03:05:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018525794] [2024-10-11 03:05:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 03:05:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018525794] [2024-10-11 03:05:26,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018525794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280720627] [2024-10-11 03:05:26,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:05:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:26,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:26,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:05:26,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:05:26,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:26,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:05:26,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 03:05:26,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:05:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280720627] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:27,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-10-11 03:05:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730931477] [2024-10-11 03:05:27,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:05:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:05:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:05:27,403 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-11 03:05:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:27,464 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-11 03:05:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:05:27,464 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 33 [2024-10-11 03:05:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:27,465 INFO L225 Difference]: With dead ends: 30 [2024-10-11 03:05:27,465 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 03:05:27,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:05:27,466 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:27,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 45 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 03:05:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 03:05:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:05:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-11 03:05:27,470 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2024-10-11 03:05:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:27,470 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-11 03:05:27,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-11 03:05:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-11 03:05:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 03:05:27,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:27,471 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:27,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:05:27,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:27,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:27,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2024-10-11 03:05:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78126735] [2024-10-11 03:05:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 03:05:27,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:27,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78126735] [2024-10-11 03:05:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78126735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502190831] [2024-10-11 03:05:27,952 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:05:27,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:27,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:27,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:05:28,003 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-11 03:05:28,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:28,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:05:28,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 03:05:28,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:05:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502190831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:28,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-10-11 03:05:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469727848] [2024-10-11 03:05:28,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:28,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:05:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:28,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:05:28,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:05:28,880 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:05:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:28,951 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-10-11 03:05:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:05:28,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 39 [2024-10-11 03:05:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:28,953 INFO L225 Difference]: With dead ends: 33 [2024-10-11 03:05:28,954 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 03:05:28,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:05:28,955 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:28,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 03:05:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 03:05:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:05:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-11 03:05:28,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2024-10-11 03:05:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:28,961 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-11 03:05:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:05:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-11 03:05:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 03:05:28,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:28,963 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:28,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:05:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:29,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2024-10-11 03:05:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387666952] [2024-10-11 03:05:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 03:05:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387666952] [2024-10-11 03:05:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387666952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80621988] [2024-10-11 03:05:29,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:05:29,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:29,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:29,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:05:29,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-11 03:05:29,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:29,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:05:29,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 03:05:29,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 03:05:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80621988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:30,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:30,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-10-11 03:05:30,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100673748] [2024-10-11 03:05:30,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:30,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:05:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:05:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:05:30,578 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 03:05:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:30,655 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-11 03:05:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:05:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 45 [2024-10-11 03:05:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:30,656 INFO L225 Difference]: With dead ends: 36 [2024-10-11 03:05:30,656 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 03:05:30,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:05:30,657 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:30,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 54 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 03:05:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 03:05:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 03:05:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-11 03:05:30,661 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2024-10-11 03:05:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:30,661 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-11 03:05:30,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 03:05:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-11 03:05:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:05:30,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:30,663 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:30,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 03:05:30,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 03:05:30,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:30,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2024-10-11 03:05:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309903559] [2024-10-11 03:05:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 03:05:31,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309903559] [2024-10-11 03:05:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309903559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806907079] [2024-10-11 03:05:31,127 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 03:05:31,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:31,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:31,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:31,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:05:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:31,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:05:31,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 03:05:31,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 03:05:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806907079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:32,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:32,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-10-11 03:05:32,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476365781] [2024-10-11 03:05:32,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:05:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:32,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:05:32,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:05:32,712 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-10-11 03:05:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:32,811 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-11 03:05:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:05:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 51 [2024-10-11 03:05:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:32,812 INFO L225 Difference]: With dead ends: 39 [2024-10-11 03:05:32,812 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 03:05:32,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:05:32,813 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:32,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 51 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:05:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 03:05:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 03:05:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 03:05:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-11 03:05:32,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2024-10-11 03:05:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:32,817 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-11 03:05:32,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-10-11 03:05:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-11 03:05:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:05:32,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:32,818 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:32,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 03:05:33,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:33,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:33,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2024-10-11 03:05:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069434724] [2024-10-11 03:05:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 03:05:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069434724] [2024-10-11 03:05:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069434724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672334725] [2024-10-11 03:05:33,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:05:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:33,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:33,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:05:33,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:05:33,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:33,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:05:33,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 03:05:33,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 03:05:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672334725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:35,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:35,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-10-11 03:05:35,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956468801] [2024-10-11 03:05:35,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:35,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:05:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:05:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:05:35,473 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-10-11 03:05:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:35,589 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-10-11 03:05:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:05:35,589 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 57 [2024-10-11 03:05:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:35,590 INFO L225 Difference]: With dead ends: 42 [2024-10-11 03:05:35,590 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 03:05:35,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:05:35,591 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:35,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 56 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:05:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 03:05:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 03:05:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 03:05:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-11 03:05:35,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2024-10-11 03:05:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:35,599 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-11 03:05:35,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-10-11 03:05:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-11 03:05:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:05:35,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:35,602 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:35,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 03:05:35,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:35,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2024-10-11 03:05:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931044908] [2024-10-11 03:05:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-11 03:05:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931044908] [2024-10-11 03:05:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931044908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369484159] [2024-10-11 03:05:36,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:05:36,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:36,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:36,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:05:36,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-11 03:05:36,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:36,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:05:36,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-11 03:05:36,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 03:05:39,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369484159] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:39,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:39,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2024-10-11 03:05:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381936499] [2024-10-11 03:05:39,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:39,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:05:39,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:05:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:05:39,003 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2024-10-11 03:05:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:39,116 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-10-11 03:05:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:05:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) Word has length 63 [2024-10-11 03:05:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:39,120 INFO L225 Difference]: With dead ends: 45 [2024-10-11 03:05:39,121 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 03:05:39,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=747, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 03:05:39,122 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:39,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 56 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:05:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 03:05:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 03:05:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 03:05:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-10-11 03:05:39,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2024-10-11 03:05:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-10-11 03:05:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2024-10-11 03:05:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-10-11 03:05:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:05:39,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:39,132 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:39,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:05:39,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:39,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2024-10-11 03:05:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604678833] [2024-10-11 03:05:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:05:39,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:05:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:05:39,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:05:39,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:05:39,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:05:39,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:05:39,390 INFO L407 BasicCegarLoop]: Path program histogram: [10, 1] [2024-10-11 03:05:39,427 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:05:39,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:05:39 BoogieIcfgContainer [2024-10-11 03:05:39,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:05:39,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:05:39,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:05:39,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:05:39,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:05:23" (3/4) ... [2024-10-11 03:05:39,431 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:05:39,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:05:39,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:05:39,473 INFO L158 Benchmark]: Toolchain (without parser) took 16373.51ms. Allocated memory was 146.8MB in the beginning and 346.0MB in the end (delta: 199.2MB). Free memory was 77.1MB in the beginning and 143.0MB in the end (delta: -65.9MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,473 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:05:39,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.97ms. Allocated memory is still 146.8MB. Free memory was 77.0MB in the beginning and 65.4MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.13ms. Allocated memory is still 146.8MB. Free memory was 65.2MB in the beginning and 64.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,474 INFO L158 Benchmark]: Boogie Preprocessor took 46.41ms. Allocated memory is still 146.8MB. Free memory was 64.0MB in the beginning and 117.5MB in the end (delta: -53.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,474 INFO L158 Benchmark]: RCFGBuilder took 213.33ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 117.4MB in the beginning and 163.3MB in the end (delta: -45.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,474 INFO L158 Benchmark]: TraceAbstraction took 15829.11ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 163.3MB in the beginning and 145.1MB in the end (delta: 18.2MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,474 INFO L158 Benchmark]: Witness Printer took 42.38ms. Allocated memory is still 346.0MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:05:39,475 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.16ms. Allocated memory is still 146.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.97ms. Allocated memory is still 146.8MB. Free memory was 77.0MB in the beginning and 65.4MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.13ms. Allocated memory is still 146.8MB. Free memory was 65.2MB in the beginning and 64.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.41ms. Allocated memory is still 146.8MB. Free memory was 64.0MB in the beginning and 117.5MB in the end (delta: -53.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * RCFGBuilder took 213.33ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 117.4MB in the beginning and 163.3MB in the end (delta: -45.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15829.11ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 163.3MB in the beginning and 145.1MB in the end (delta: 18.2MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. * Witness Printer took 42.38ms. Allocated memory is still 346.0MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 10; [L15] int b = 0; VAL [a=10, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=10, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 643 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 80 mSDtfsCounter, 643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 668 SyntacticMatches, 55 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, InterpolantAutomatonStates: 95, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 3004 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1242 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1065/2700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 03:05:39,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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