./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_15x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_15x0-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b32326f1b997cecaa031e8ab338eea5ffa634c465fc73ccabccfc7d02b1e5cc1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:21:12,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:21:12,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:21:12,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:21:12,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:21:12,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:21:12,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:21:12,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:21:12,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:21:12,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:21:12,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:21:12,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:21:12,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:21:12,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:21:12,308 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:21:12,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:21:12,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:21:12,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:21:12,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:21:12,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:21:12,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:21:12,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:21:12,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:21:12,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:21:12,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:21:12,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:21:12,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:21:12,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:21:12,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:21:12,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:21:12,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:21:12,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:21:12,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:21:12,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:21:12,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:21:12,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:21:12,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:21:12,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:21:12,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:21:12,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:21:12,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:21:12,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:21:12,323 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b32326f1b997cecaa031e8ab338eea5ffa634c465fc73ccabccfc7d02b1e5cc1 [2024-11-08 15:21:12,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:21:12,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:21:12,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:21:12,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:21:12,541 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:21:12,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2024-11-08 15:21:13,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:21:14,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:21:14,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2024-11-08 15:21:14,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b71a312/152e8943c64641cdb34a73e8f7aa527f/FLAG1376b56ac [2024-11-08 15:21:14,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b71a312/152e8943c64641cdb34a73e8f7aa527f [2024-11-08 15:21:14,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:21:14,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:21:14,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:21:14,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:21:14,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:21:14,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffd118a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14, skipping insertion in model container [2024-11-08 15:21:14,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:21:14,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-1.c[481,494] [2024-11-08 15:21:14,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:21:14,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:21:14,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-1.c[481,494] [2024-11-08 15:21:14,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:21:14,244 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:21:14,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14 WrapperNode [2024-11-08 15:21:14,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:21:14,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:21:14,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:21:14,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:21:14,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,268 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-08 15:21:14,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:21:14,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:21:14,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:21:14,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:21:14,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,286 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-11-08 15:21:14,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:21:14,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:21:14,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:21:14,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:21:14,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (1/1) ... [2024-11-08 15:21:14,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:21:14,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:14,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:21:14,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:21:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:21:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:21:14,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:21:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-08 15:21:14,361 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-08 15:21:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:21:14,407 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:21:14,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:21:14,493 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 15:21:14,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:21:14,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:21:14,506 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:21:14,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:14 BoogieIcfgContainer [2024-11-08 15:21:14,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:21:14,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:21:14,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:21:14,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:21:14,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:21:14" (1/3) ... [2024-11-08 15:21:14,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3637b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:21:14, skipping insertion in model container [2024-11-08 15:21:14,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:14" (2/3) ... [2024-11-08 15:21:14,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3637b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:21:14, skipping insertion in model container [2024-11-08 15:21:14,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:14" (3/3) ... [2024-11-08 15:21:14,516 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2024-11-08 15:21:14,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:21:14,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:21:14,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:21:14,585 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;@225e1939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:21:14,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:21:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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-11-08 15:21:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:21:14,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:14,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:14,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-08 15:21:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339760874] [2024-11-08 15:21:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:21:14,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339760874] [2024-11-08 15:21:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339760874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:21:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:21:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:21:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820641750] [2024-11-08 15:21:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:21:14,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:21:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:21:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:21:14,950 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-11-08 15:21:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:15,016 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-08 15:21:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:21:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-11-08 15:21:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:15,025 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:21:15,026 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:21:15,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-08 15:21:15,036 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:15,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:21:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:21:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 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-11-08 15:21:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:21:15,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-08 15:21:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:21:15,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-11-08 15:21:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:21:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:21:15,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:15,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:15,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:21:15,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:15,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-08 15:21:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345448831] [2024-11-08 15:21:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:21:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345448831] [2024-11-08 15:21:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345448831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082565746] [2024-11-08 15:21:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:15,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:15,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:15,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:21:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:21:15,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:21:15,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:21:15,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082565746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:15,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-11-08 15:21:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729714206] [2024-11-08 15:21:15,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:15,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:21:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:21:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:21:15,572 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 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-11-08 15:21:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:15,609 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 15:21:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:21:15,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 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 16 [2024-11-08 15:21:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:15,610 INFO L225 Difference]: With dead ends: 22 [2024-11-08 15:21:15,610 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 15:21:15,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 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-11-08 15:21:15,612 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 15:21:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 15:21:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-11-08 15:21:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-08 15:21:15,616 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-08 15:21:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:15,616 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-08 15:21:15,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 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-11-08 15:21:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-08 15:21:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:21:15,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:15,618 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:15,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:15,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:15,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-08 15:21:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:15,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787263828] [2024-11-08 15:21:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:21:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787263828] [2024-11-08 15:21:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787263828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498533566] [2024-11-08 15:21:15,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:21:15,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:15,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:15,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:15,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:21:16,040 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:21:16,040 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:16,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:21:16,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:21:16,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:21:16,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498533566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:16,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:16,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-11-08 15:21:16,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198617738] [2024-11-08 15:21:16,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:16,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:21:16,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:21:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:21:16,406 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 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-11-08 15:21:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:16,450 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-08 15:21:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:21:16,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 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 22 [2024-11-08 15:21:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:16,451 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:21:16,451 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:21:16,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 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-11-08 15:21:16,453 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:16,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:21:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 15:21:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 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-11-08 15:21:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-08 15:21:16,457 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-08 15:21:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:16,457 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-08 15:21:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 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-11-08 15:21:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-08 15:21:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:21:16,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:16,458 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:16,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:16,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 15:21:16,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:16,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-08 15:21:16,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647288118] [2024-11-08 15:21:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647288118] [2024-11-08 15:21:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647288118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307513846] [2024-11-08 15:21:16,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:21:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:16,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:16,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:21:16,999 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:21:16,999 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:17,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:21:17,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:17,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:21:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307513846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:17,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-11-08 15:21:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658758092] [2024-11-08 15:21:17,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:21:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:21:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:21:17,431 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 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-11-08 15:21:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:17,485 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-08 15:21:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:21:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 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 28 [2024-11-08 15:21:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:17,486 INFO L225 Difference]: With dead ends: 28 [2024-11-08 15:21:17,486 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 15:21:17,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 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-11-08 15:21:17,487 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:17,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 15:21:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 15:21:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 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-11-08 15:21:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-08 15:21:17,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2024-11-08 15:21:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:17,495 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-08 15:21:17,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 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-11-08 15:21:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-08 15:21:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:21:17,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:17,496 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:17,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:21:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:17,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2024-11-08 15:21:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23984110] [2024-11-08 15:21:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:21:17,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23984110] [2024-11-08 15:21:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23984110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626571563] [2024-11-08 15:21:17,888 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:21:17,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:17,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:17,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:17,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:21:17,937 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:21:17,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:17,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:21:17,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:21:17,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:21:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626571563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:18,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:18,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-08 15:21:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551261815] [2024-11-08 15:21:18,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:18,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:21:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:21:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:21:18,565 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 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-11-08 15:21:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:18,632 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-08 15:21:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:21:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 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 34 [2024-11-08 15:21:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:18,634 INFO L225 Difference]: With dead ends: 31 [2024-11-08 15:21:18,634 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 15:21:18,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 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-11-08 15:21:18,635 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:18,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 60 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 15:21:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 15:21:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 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-11-08 15:21:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-08 15:21:18,639 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2024-11-08 15:21:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:18,639 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-08 15:21:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 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-11-08 15:21:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-08 15:21:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:21:18,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:18,640 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:18,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:21:18,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:18,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:18,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2024-11-08 15:21:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835977156] [2024-11-08 15:21:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 15:21:19,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:19,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835977156] [2024-11-08 15:21:19,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835977156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:19,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064006569] [2024-11-08 15:21:19,025 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:21:19,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:19,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:19,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:21:19,074 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-08 15:21:19,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:19,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:21:19,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 15:21:19,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064006569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:20,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-11-08 15:21:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188140788] [2024-11-08 15:21:20,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:21:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:21:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:21:20,100 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 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-11-08 15:21:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:20,167 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-08 15:21:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:21:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 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 40 [2024-11-08 15:21:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:20,168 INFO L225 Difference]: With dead ends: 34 [2024-11-08 15:21:20,168 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 15:21:20,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 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-11-08 15:21:20,169 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:20,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 15:21:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 15:21:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 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-11-08 15:21:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-08 15:21:20,173 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2024-11-08 15:21:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:20,174 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-08 15:21:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 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-11-08 15:21:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-08 15:21:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:21:20,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:20,175 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:20,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:21:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:20,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:20,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2024-11-08 15:21:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529817992] [2024-11-08 15:21:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 15:21:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529817992] [2024-11-08 15:21:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529817992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005084276] [2024-11-08 15:21:20,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:21:20,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:20,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:20,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:20,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:21:20,693 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-08 15:21:20,694 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:20,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:21:20,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 15:21:20,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 15:21:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005084276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:21,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-11-08 15:21:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710161425] [2024-11-08 15:21:21,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:21:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:21:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:21:21,928 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 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-11-08 15:21:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:21,995 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-08 15:21:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:21:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 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 46 [2024-11-08 15:21:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:21,996 INFO L225 Difference]: With dead ends: 37 [2024-11-08 15:21:21,996 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 15:21:21,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 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-11-08 15:21:21,998 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:21,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 15:21:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 15:21:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 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-11-08 15:21:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-08 15:21:22,002 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2024-11-08 15:21:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:22,002 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-08 15:21:22,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 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-11-08 15:21:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-08 15:21:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:21:22,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:22,004 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:22,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:22,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:22,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:22,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2024-11-08 15:21:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449229166] [2024-11-08 15:21:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:22,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 15:21:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449229166] [2024-11-08 15:21:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449229166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320047727] [2024-11-08 15:21:22,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 15:21:22,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:22,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:22,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:22,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 15:21:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:21:22,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 15:21:22,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 15:21:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320047727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:24,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-11-08 15:21:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428497895] [2024-11-08 15:21:24,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:21:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:21:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:21:24,239 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 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-11-08 15:21:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:24,309 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-08 15:21:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:21:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 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 52 [2024-11-08 15:21:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:24,310 INFO L225 Difference]: With dead ends: 40 [2024-11-08 15:21:24,310 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 15:21:24,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 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-11-08 15:21:24,311 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:24,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 15:21:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 15:21:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 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-11-08 15:21:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-08 15:21:24,315 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-08 15:21:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-08 15:21:24,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 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-11-08 15:21:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-08 15:21:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 15:21:24,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:24,319 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:24,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 15:21:24,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:24,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2024-11-08 15:21:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760870296] [2024-11-08 15:21:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:21:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760870296] [2024-11-08 15:21:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760870296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489265281] [2024-11-08 15:21:24,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:21:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:24,896 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:24,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 15:21:24,987 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:21:24,988 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:24,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 15:21:24,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:21:25,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 15:21:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489265281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:27,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:27,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-11-08 15:21:27,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680085316] [2024-11-08 15:21:27,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:27,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:21:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:27,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:21:27,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:21:27,260 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 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-11-08 15:21:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:27,356 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-08 15:21:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:21:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 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 58 [2024-11-08 15:21:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:27,357 INFO L225 Difference]: With dead ends: 43 [2024-11-08 15:21:27,357 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 15:21:27,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 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-11-08 15:21:27,358 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:27,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 15:21:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 15:21:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 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-11-08 15:21:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-08 15:21:27,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2024-11-08 15:21:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:27,363 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-08 15:21:27,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 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-11-08 15:21:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-08 15:21:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:21:27,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:27,364 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:27,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 15:21:27,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 15:21:27,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:27,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2024-11-08 15:21:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187333074] [2024-11-08 15:21:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 15:21:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:28,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187333074] [2024-11-08 15:21:28,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187333074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:28,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016594569] [2024-11-08 15:21:28,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:21:28,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:28,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:28,005 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:28,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 15:21:28,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-08 15:21:28,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:28,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 15:21:28,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 15:21:28,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 15:21:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016594569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:31,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2024-11-08 15:21:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726404326] [2024-11-08 15:21:31,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:31,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 15:21:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 15:21:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-11-08 15:21:31,200 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-08 15:21:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:31,291 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-08 15:21:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:21:31,291 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) Word has length 64 [2024-11-08 15:21:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:31,292 INFO L225 Difference]: With dead ends: 46 [2024-11-08 15:21:31,292 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 15:21:31,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 125 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=812, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:21:31,293 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:31,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 91 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 15:21:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 15:21:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 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-11-08 15:21:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-08 15:21:31,297 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2024-11-08 15:21:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:31,298 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-08 15:21:31,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-08 15:21:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-08 15:21:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 15:21:31,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:31,299 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:31,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:31,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:21:31,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:31,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2024-11-08 15:21:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825296473] [2024-11-08 15:21:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-08 15:21:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825296473] [2024-11-08 15:21:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825296473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112701553] [2024-11-08 15:21:32,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:21:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:32,019 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:32,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 15:21:32,202 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:21:32,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:32,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 15:21:32,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-08 15:21:32,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 15:21:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112701553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:36,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2024-11-08 15:21:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665975730] [2024-11-08 15:21:36,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 15:21:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 15:21:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:21:36,240 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-08 15:21:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:36,352 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-08 15:21:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:21:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) Word has length 70 [2024-11-08 15:21:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:36,353 INFO L225 Difference]: With dead ends: 49 [2024-11-08 15:21:36,353 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 15:21:36,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 137 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=448, Invalid=958, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 15:21:36,354 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:36,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 107 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 15:21:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-08 15:21:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:21:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-08 15:21:36,358 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 70 [2024-11-08 15:21:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:36,358 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-08 15:21:36,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-08 15:21:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-08 15:21:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:21:36,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:36,359 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:36,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 15:21:36,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 15:21:36,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:36,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1354232598, now seen corresponding path program 11 times [2024-11-08 15:21:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056979087] [2024-11-08 15:21:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:37,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-08 15:21:37,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056979087] [2024-11-08 15:21:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056979087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256127144] [2024-11-08 15:21:37,067 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:21:37,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:37,069 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:37,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 15:21:37,284 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-08 15:21:37,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:37,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 15:21:37,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-08 15:21:37,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-08 15:21:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256127144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:42,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2024-11-08 15:21:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345254614] [2024-11-08 15:21:42,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 15:21:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:42,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 15:21:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:21:42,688 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-08 15:21:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:42,809 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-08 15:21:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:21:42,809 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 76 [2024-11-08 15:21:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:42,810 INFO L225 Difference]: With dead ends: 52 [2024-11-08 15:21:42,810 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 15:21:42,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 15:21:42,811 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:42,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 105 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 15:21:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 15:21:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 15:21:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-11-08 15:21:42,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 76 [2024-11-08 15:21:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:42,816 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-11-08 15:21:42,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-08 15:21:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-11-08 15:21:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:21:42,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:42,817 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:42,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:43,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 15:21:43,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:43,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1734686668, now seen corresponding path program 12 times [2024-11-08 15:21:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:43,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940552304] [2024-11-08 15:21:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-08 15:21:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940552304] [2024-11-08 15:21:43,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940552304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978985839] [2024-11-08 15:21:43,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:21:43,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:43,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:43,637 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:43,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 15:21:43,915 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-08 15:21:43,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:43,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 15:21:43,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-08 15:21:43,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 15:21:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978985839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:50,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:50,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2024-11-08 15:21:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060354954] [2024-11-08 15:21:50,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 15:21:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 15:21:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:21:50,699 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-08 15:21:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:50,829 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-08 15:21:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:21:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) Word has length 82 [2024-11-08 15:21:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:50,830 INFO L225 Difference]: With dead ends: 55 [2024-11-08 15:21:50,830 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 15:21:50,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 161 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=606, Invalid=1286, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:21:50,831 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:50,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 104 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 15:21:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 15:21:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 15:21:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-08 15:21:50,835 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 82 [2024-11-08 15:21:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:50,836 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-08 15:21:50,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-08 15:21:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-11-08 15:21:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 15:21:50,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:50,840 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:50,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 15:21:51,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1433749930, now seen corresponding path program 13 times [2024-11-08 15:21:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:51,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201363737] [2024-11-08 15:21:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 15:21:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201363737] [2024-11-08 15:21:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201363737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579599702] [2024-11-08 15:21:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 15:21:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:51,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:51,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 15:21:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:52,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 15:21:52,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 15:21:52,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 15:22:00,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579599702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:22:00,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:22:00,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2024-11-08 15:22:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289915888] [2024-11-08 15:22:00,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:00,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 15:22:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:00,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 15:22:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 15:22:00,445 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-08 15:22:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:00,593 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-11-08 15:22:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:22:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) Word has length 88 [2024-11-08 15:22:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:00,594 INFO L225 Difference]: With dead ends: 58 [2024-11-08 15:22:00,594 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 15:22:00,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 173 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=694, Invalid=1468, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 15:22:00,595 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 165 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:00,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 114 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:22:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 15:22:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 15:22:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:22:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2024-11-08 15:22:00,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 88 [2024-11-08 15:22:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:00,603 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2024-11-08 15:22:00,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-08 15:22:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-11-08 15:22:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 15:22:00,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:00,603 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:00,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 15:22:00,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 15:22:00,804 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1321174388, now seen corresponding path program 14 times [2024-11-08 15:22:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:00,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908331242] [2024-11-08 15:22:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:02,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:02,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-08 15:22:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908331242] [2024-11-08 15:22:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908331242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971285680] [2024-11-08 15:22:02,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:22:02,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:02,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:22:02,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 15:22:02,571 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:22:02,571 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:22:02,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 15:22:02,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-08 15:22:02,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 15:22:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971285680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:22:12,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:22:12,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2024-11-08 15:22:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797772583] [2024-11-08 15:22:12,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 15:22:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 15:22:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:22:12,451 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-08 15:22:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:12,625 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2024-11-08 15:22:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:22:12,625 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) Word has length 94 [2024-11-08 15:22:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:12,626 INFO L225 Difference]: With dead ends: 61 [2024-11-08 15:22:12,626 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 15:22:12,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 185 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=785, Invalid=1567, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 15:22:12,627 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:12,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 121 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:22:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 15:22:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 15:22:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 15:22:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-08 15:22:12,635 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 94 [2024-11-08 15:22:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:12,639 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-08 15:22:12,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-08 15:22:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-08 15:22:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:22:12,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:12,640 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 15:22:12,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:12,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:12,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 15 times [2024-11-08 15:22:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:12,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139421920] [2024-11-08 15:22:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:14,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-11-08 15:22:15,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:15,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139421920] [2024-11-08 15:22:15,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139421920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:15,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137209339] [2024-11-08 15:22:15,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:22:15,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:15,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:15,616 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:22:15,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 15:22:16,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-08 15:22:16,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:22:16,232 WARN L253 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 195 conjuncts are in the unsatisfiable core [2024-11-08 15:22:16,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-08 15:22:16,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:22:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137209339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:22:16,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:22:16,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2024-11-08 15:22:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489401186] [2024-11-08 15:22:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:22:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:22:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:22:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:22:16,385 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 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-11-08 15:22:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:16,430 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-11-08 15:22:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:22:16,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 100 [2024-11-08 15:22:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:16,431 INFO L225 Difference]: With dead ends: 57 [2024-11-08 15:22:16,431 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:22:16,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:22:16,433 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:16,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:22:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:22:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:22:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:22:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:22:16,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2024-11-08 15:22:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:16,434 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:22:16,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 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-11-08 15:22:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:22:16,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:22:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:22:16,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 15:22:16,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 15:22:16,640 INFO L407 BasicCegarLoop]: Path program histogram: [15, 1] [2024-11-08 15:22:16,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:22:16,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:22:16,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:22:16 BoogieIcfgContainer [2024-11-08 15:22:16,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:22:16,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:22:16,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:22:16,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:22:16,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:14" (3/4) ... [2024-11-08 15:22:16,789 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:22:16,792 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2024-11-08 15:22:16,794 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 15:22:16,794 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:22:16,795 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 15:22:16,795 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:22:16,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:22:16,852 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:22:16,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:22:16,852 INFO L158 Benchmark]: Toolchain (without parser) took 62788.15ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 118.9MB in the beginning and 693.8MB in the end (delta: -574.9MB). Peak memory consumption was 339.9MB. Max. memory is 16.1GB. [2024-11-08 15:22:16,852 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:22:16,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.61ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 106.2MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 15:22:16,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.55ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 104.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:22:16,853 INFO L158 Benchmark]: Boogie Preprocessor took 21.17ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 103.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:16,853 INFO L158 Benchmark]: RCFGBuilder took 215.69ms. Allocated memory is still 176.2MB. Free memory was 103.0MB in the beginning and 93.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:22:16,853 INFO L158 Benchmark]: TraceAbstraction took 62277.73ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 92.2MB in the beginning and 698.0MB in the end (delta: -605.8MB). Peak memory consumption was 308.5MB. Max. memory is 16.1GB. [2024-11-08 15:22:16,853 INFO L158 Benchmark]: Witness Printer took 65.46ms. Allocated memory is still 1.1GB. Free memory was 698.0MB in the beginning and 693.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:22:16,854 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.11ms. Allocated memory is still 176.2MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.61ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 106.2MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.55ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 104.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.17ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 103.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 215.69ms. Allocated memory is still 176.2MB. Free memory was 103.0MB in the beginning and 93.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 62277.73ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 92.2MB in the beginning and 698.0MB in the end (delta: -605.8MB). Peak memory consumption was 308.5MB. Max. memory is 16.1GB. * Witness Printer took 65.46ms. Allocated memory is still 1.1GB. Free memory was 698.0MB in the beginning and 693.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.1s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 1209 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1124 IncrementalHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 159 mSDtfsCounter, 1124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2191 GetRequests, 1659 SyntacticMatches, 120 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5371 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=15, InterpolantAutomatonStates: 188, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 1750 NumberOfCodeBlocks, 1750 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 2475 ConstructedInterpolants, 0 QuantifiedInterpolants, 7645 SizeOfPredicates, 135 NumberOfNonLiveVariables, 2865 ConjunctsInSsa, 461 ConjunctsInUnsatCore, 45 InterpolantComputations, 2 PerfectInterpolantSequences, 5060/10830 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum. Ensures: (\result == ((long long) n + m)) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:22:16,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE