./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_10x0-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_10x0-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 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:21:09,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:21:09,409 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:09,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:21:09,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:21:09,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:21:09,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:21:09,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:21:09,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:21:09,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:21:09,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:21:09,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:21:09,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:21:09,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:21:09,449 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:21:09,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:21:09,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:21:09,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:21:09,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:21:09,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:21:09,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:21:09,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:21:09,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:21:09,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:21:09,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:21:09,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:21:09,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:21:09,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:21:09,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:21:09,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:21:09,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:21:09,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:21:09,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:21:09,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:21:09,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:21:09,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:21:09,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:21:09,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:21:09,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:21:09,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:21:09,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:21:09,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:21:09,460 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 -> 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 [2024-11-08 15:21:09,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:21:09,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:21:09,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:21:09,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:21:09,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:21:09,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2024-11-08 15:21:11,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:21:11,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:21:11,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2024-11-08 15:21:11,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab06dae1c/922b4d428b8d4e10a83546359c515a5c/FLAG17c42e503 [2024-11-08 15:21:11,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab06dae1c/922b4d428b8d4e10a83546359c515a5c [2024-11-08 15:21:11,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:21:11,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:21:11,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:21:11,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:21:11,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:21:11,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:21:11" (1/1) ... [2024-11-08 15:21:11,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089846b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:11, skipping insertion in model container [2024-11-08 15:21:11,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:21:11" (1/1) ... [2024-11-08 15:21:11,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:21:11,988 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_10x0-1.c[481,494] [2024-11-08 15:21:11,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:21:12,003 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:21:12,018 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_10x0-1.c[481,494] [2024-11-08 15:21:12,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:21:12,034 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:21:12,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:12 WrapperNode [2024-11-08 15:21:12,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:21:12,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:21:12,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:21:12,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:21:12,042 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:12" (1/1) ... [2024-11-08 15:21:12,047 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:12" (1/1) ... [2024-11-08 15:21:12,059 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-08 15:21:12,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:21:12,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:21:12,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:21:12,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:21:12,069 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:12" (1/1) ... [2024-11-08 15:21:12,069 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:12" (1/1) ... [2024-11-08 15:21:12,070 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:12" (1/1) ... [2024-11-08 15:21:12,079 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:12,079 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:12" (1/1) ... [2024-11-08 15:21:12,079 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:12" (1/1) ... [2024-11-08 15:21:12,081 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:12" (1/1) ... [2024-11-08 15:21:12,083 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:12" (1/1) ... [2024-11-08 15:21:12,083 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:12" (1/1) ... [2024-11-08 15:21:12,084 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:12" (1/1) ... [2024-11-08 15:21:12,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:21:12,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:21:12,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:21:12,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:21:12,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:12" (1/1) ... [2024-11-08 15:21:12,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:21:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:12,125 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:12,128 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:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:21:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:21:12,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:21:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-08 15:21:12,168 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-08 15:21:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:21:12,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:21:12,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:21:12,348 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 15:21:12,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:21:12,360 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:21:12,360 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:21:12,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:12 BoogieIcfgContainer [2024-11-08 15:21:12,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:21:12,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:21:12,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:21:12,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:21:12,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:21:11" (1/3) ... [2024-11-08 15:21:12,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e9a1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:21:12, skipping insertion in model container [2024-11-08 15:21:12,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:12" (2/3) ... [2024-11-08 15:21:12,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e9a1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:21:12, skipping insertion in model container [2024-11-08 15:21:12,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:12" (3/3) ... [2024-11-08 15:21:12,371 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2024-11-08 15:21:12,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:21:12,387 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:21:12,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:21:12,460 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;@3d51b264, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:21:12,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:21:12,464 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:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:21:12,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:12,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:12,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-08 15:21:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:12,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878321259] [2024-11-08 15:21:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:12,800 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:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878321259] [2024-11-08 15:21:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878321259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:21:12,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:21:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:21:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914666757] [2024-11-08 15:21:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:21:12,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:21:12,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:21:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:21:12,832 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:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:12,883 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-08 15:21:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:21:12,886 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:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:12,894 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:21:12,894 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:21:12,897 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:12,902 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:12,904 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:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:21:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:21:12,939 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:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:21:12,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-08 15:21:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:21:12,942 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:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:21:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:21:12,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:12,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:12,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:21:12,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:12,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-08 15:21:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:12,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968037141] [2024-11-08 15:21:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:13,163 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:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968037141] [2024-11-08 15:21:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968037141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254707969] [2024-11-08 15:21:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:13,167 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:13,169 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:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:13,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:21:13,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:13,324 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:13,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:13,557 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:13,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254707969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:13,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:13,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-11-08 15:21:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850173498] [2024-11-08 15:21:13,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:21:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:21:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:21:13,563 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:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:13,622 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 15:21:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:21:13,623 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:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:13,624 INFO L225 Difference]: With dead ends: 22 [2024-11-08 15:21:13,624 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 15:21:13,625 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:13,626 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:13,629 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:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 15:21:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 15:21:13,635 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:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-08 15:21:13,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-08 15:21:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-08 15:21:13,637 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:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-08 15:21:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:21:13,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:13,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:13,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:21:13,844 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:13,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-08 15:21:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908332240] [2024-11-08 15:21:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,132 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:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908332240] [2024-11-08 15:21:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908332240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807405347] [2024-11-08 15:21:14,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:21:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:14,137 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:14,138 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:14,178 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:21:14,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:14,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:21:14,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:14,217 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:14,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:14,511 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:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807405347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:14,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-11-08 15:21:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425336662] [2024-11-08 15:21:14,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:21:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:21:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:21:14,514 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:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:14,567 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-08 15:21:14,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:21:14,568 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:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:14,569 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:21:14,569 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:21:14,569 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:14,571 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:14,571 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:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:21:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 15:21:14,577 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:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-08 15:21:14,579 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-08 15:21:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:14,579 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-08 15:21:14,580 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:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-08 15:21:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:21:14,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:14,582 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:14,599 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:14,782 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:14,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:14,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-08 15:21:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955534348] [2024-11-08 15:21:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:14,996 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:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955534348] [2024-11-08 15:21:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955534348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465772708] [2024-11-08 15:21:14,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:21:14,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:14,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:15,000 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:15,001 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:15,051 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:21:15,051 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:15,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:21:15,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:15,102 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:15,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:15,627 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:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465772708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:15,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:15,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-11-08 15:21:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700570215] [2024-11-08 15:21:15,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:15,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:21:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:21:15,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:21:15,630 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:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:15,697 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-08 15:21:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:21:15,698 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:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:15,699 INFO L225 Difference]: With dead ends: 28 [2024-11-08 15:21:15,699 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 15:21:15,700 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:15,701 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:15,701 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:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 15:21:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 15:21:15,705 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:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-08 15:21:15,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2024-11-08 15:21:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:15,706 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-08 15:21:15,706 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:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-08 15:21:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:21:15,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:15,707 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:15,725 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:15,907 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:15,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2024-11-08 15:21:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490314084] [2024-11-08 15:21:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:16,170 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:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:16,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490314084] [2024-11-08 15:21:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490314084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197878215] [2024-11-08 15:21:16,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:21:16,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:16,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:16,175 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:16,176 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:16,233 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:21:16,234 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:16,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:21:16,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:16,297 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:16,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:17,079 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:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197878215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:17,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-08 15:21:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409523624] [2024-11-08 15:21:17,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:17,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:21:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:17,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:21:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:21:17,086 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:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:17,175 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-08 15:21:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:21:17,176 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:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:17,177 INFO L225 Difference]: With dead ends: 31 [2024-11-08 15:21:17,177 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 15:21:17,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:21:17,178 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:17,178 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.1s Time] [2024-11-08 15:21:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 15:21:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 15:21:17,188 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:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-08 15:21:17,191 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2024-11-08 15:21:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:17,191 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-08 15:21:17,191 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:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-08 15:21:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:21:17,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:17,192 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:17,213 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:17,393 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:17,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2024-11-08 15:21:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400234936] [2024-11-08 15:21:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:17,671 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:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400234936] [2024-11-08 15:21:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400234936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999462976] [2024-11-08 15:21:17,672 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:21:17,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:17,674 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:17,675 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:17,737 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-08 15:21:17,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:17,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:21:17,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:17,790 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:17,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999462976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:18,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-11-08 15:21:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061493523] [2024-11-08 15:21:18,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:21:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:21:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:21:18,880 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:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:18,967 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-08 15:21:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:21:18,967 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:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:18,969 INFO L225 Difference]: With dead ends: 34 [2024-11-08 15:21:18,969 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 15:21:18,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:21:18,971 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:18,973 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.1s Time] [2024-11-08 15:21:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 15:21:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 15:21:18,978 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:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-08 15:21:18,979 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2024-11-08 15:21:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:18,980 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-08 15:21:18,980 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:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-08 15:21:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:21:18,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:18,981 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:18,994 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:19,183 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:19,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2024-11-08 15:21:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776227974] [2024-11-08 15:21:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,504 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:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776227974] [2024-11-08 15:21:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776227974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065652869] [2024-11-08 15:21:19,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:21:19,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:19,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:19,507 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:19,508 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:19,586 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-08 15:21:19,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:19,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:21:19,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:19,643 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:19,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:21,177 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,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065652869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:21,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:21,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-11-08 15:21:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593077680] [2024-11-08 15:21:21,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:21,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:21:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:21:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:21:21,179 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,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:21,259 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-08 15:21:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:21:21,259 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,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:21,260 INFO L225 Difference]: With dead ends: 37 [2024-11-08 15:21:21,260 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 15:21:21,261 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,262 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,262 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,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 15:21:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 15:21:21,266 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:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-08 15:21:21,267 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2024-11-08 15:21:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:21,268 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-08 15:21:21,268 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:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-08 15:21:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:21:21,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:21,269 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:21,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:21:21,471 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:21,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2024-11-08 15:21:21,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:21,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416935032] [2024-11-08 15:21:21,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:21,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,843 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:21,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416935032] [2024-11-08 15:21:21,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416935032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448832904] [2024-11-08 15:21:21,844 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 15:21:21,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:21,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:21,846 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:21,847 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:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:21:21,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:21,996 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:21,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:23,855 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:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448832904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:23,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-11-08 15:21:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973550007] [2024-11-08 15:21:23,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:23,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:21:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:21:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:21:23,858 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:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:23,946 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-08 15:21:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:21:23,947 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:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:23,948 INFO L225 Difference]: With dead ends: 40 [2024-11-08 15:21:23,948 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 15:21:23,949 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:23,949 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:23,950 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:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 15:21:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 15:21:23,954 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:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-08 15:21:23,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-08 15:21:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-08 15:21:23,955 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:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-08 15:21:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 15:21:23,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:23,959 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:23,976 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,160 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,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:24,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2024-11-08 15:21:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475178733] [2024-11-08 15:21:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:24,665 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,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475178733] [2024-11-08 15:21:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475178733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358197014] [2024-11-08 15:21:24,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:21:24,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:24,668 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,669 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,795 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:21:24,795 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:24,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 15:21:24,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:24,861 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,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:27,328 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,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358197014] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:27,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-11-08 15:21:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738583123] [2024-11-08 15:21:27,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:27,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:21:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:21:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:21:27,330 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,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:27,435 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-08 15:21:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:21:27,435 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,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:27,436 INFO L225 Difference]: With dead ends: 43 [2024-11-08 15:21:27,436 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 15:21:27,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:21:27,438 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:27,438 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.1s Time] [2024-11-08 15:21:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 15:21:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 15:21:27,443 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,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-08 15:21:27,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2024-11-08 15:21:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:27,444 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-08 15:21:27,444 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,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-08 15:21:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:21:27,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:27,445 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,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:27,649 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,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:27,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2024-11-08 15:21:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638195279] [2024-11-08 15:21:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,196 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,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638195279] [2024-11-08 15:21:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638195279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196639408] [2024-11-08 15:21:28,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:21:28,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:28,199 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,201 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,357 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-08 15:21:28,358 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:28,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 15:21:28,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:28,427 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,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:31,785 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,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196639408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:31,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:31,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2024-11-08 15:21:31,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794409720] [2024-11-08 15:21:31,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:31,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 15:21:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 15:21:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:21:31,788 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-08 15:21:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:31,897 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-08 15:21:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:21:31,897 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) Word has length 64 [2024-11-08 15:21:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:31,898 INFO L225 Difference]: With dead ends: 46 [2024-11-08 15:21:31,898 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 15:21:31,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=747, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 15:21:31,899 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:31,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 15:21:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 15:21:31,904 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,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-08 15:21:31,905 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2024-11-08 15:21:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:31,905 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-08 15:21:31,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-08 15:21:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-08 15:21:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 15:21:31,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:31,907 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,924 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:32,111 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:32,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2024-11-08 15:21:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:32,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358602878] [2024-11-08 15:21:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:32,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-08 15:21:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358602878] [2024-11-08 15:21:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358602878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134958015] [2024-11-08 15:21:33,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:21:33,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:33,883 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:33,885 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:34,100 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:21:34,100 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:34,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-08 15:21:34,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 19 proven. 155 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 15:21:34,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 15:21:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134958015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:37,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 29, 29] total 41 [2024-11-08 15:21:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163553684] [2024-11-08 15:21:37,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 15:21:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 15:21:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1544, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 15:21:37,671 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 14 states have return successors, (15), 14 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-08 15:21:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:38,783 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-08 15:21:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 15:21:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 14 states have return successors, (15), 14 states have call predecessors, (15), 6 states have call successors, (15) Word has length 70 [2024-11-08 15:21:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:38,784 INFO L225 Difference]: With dead ends: 45 [2024-11-08 15:21:38,784 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:21:38,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=401, Invalid=4155, Unknown=0, NotChecked=0, Total=4556 [2024-11-08 15:21:38,786 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 89 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:38,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 395 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:21:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:21:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:21:38,786 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:21:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:21:38,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-11-08 15:21:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:38,787 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:21:38,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 14 states have return successors, (15), 14 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-08 15:21:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:21:38,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:21:38,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:21:38,802 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:38,990 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:38,993 INFO L407 BasicCegarLoop]: Path program histogram: [10, 1] [2024-11-08 15:21:38,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:21:39,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:21:39,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:21:39 BoogieIcfgContainer [2024-11-08 15:21:39,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:21:39,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:21:39,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:21:39,199 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:21:39,200 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:12" (3/4) ... [2024-11-08 15:21:39,202 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:21:39,207 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2024-11-08 15:21:39,211 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 15:21:39,211 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:21:39,211 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 15:21:39,211 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:21:39,269 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:21:39,269 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:21:39,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:21:39,270 INFO L158 Benchmark]: Toolchain (without parser) took 27541.82ms. Allocated memory was 176.2MB in the beginning and 474.0MB in the end (delta: 297.8MB). Free memory was 107.6MB in the beginning and 255.8MB in the end (delta: -148.2MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2024-11-08 15:21:39,270 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:21:39,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.09ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 143.3MB in the end (delta: -35.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:21:39,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.87ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 141.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:21:39,271 INFO L158 Benchmark]: Boogie Preprocessor took 24.90ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 140.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:21:39,271 INFO L158 Benchmark]: RCFGBuilder took 275.30ms. Allocated memory is still 176.2MB. Free memory was 140.2MB in the beginning and 130.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:21:39,271 INFO L158 Benchmark]: TraceAbstraction took 26834.90ms. Allocated memory was 176.2MB in the beginning and 474.0MB in the end (delta: 297.8MB). Free memory was 129.3MB in the beginning and 260.0MB in the end (delta: -130.7MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. [2024-11-08 15:21:39,272 INFO L158 Benchmark]: Witness Printer took 70.54ms. Allocated memory is still 474.0MB. Free memory was 260.0MB in the beginning and 255.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:21:39,274 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.18ms. Allocated memory is still 109.1MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.09ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 143.3MB in the end (delta: -35.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.87ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 141.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.90ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 140.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.30ms. Allocated memory is still 176.2MB. Free memory was 140.2MB in the beginning and 130.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26834.90ms. Allocated memory was 176.2MB in the beginning and 474.0MB in the end (delta: 297.8MB). Free memory was 129.3MB in the beginning and 260.0MB in the end (delta: -130.7MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. * Witness Printer took 70.54ms. Allocated memory is still 474.0MB. Free memory was 260.0MB in the beginning and 255.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: 26.6s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 901 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1380 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 118 mSDtfsCounter, 1380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 843 SyntacticMatches, 55 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, InterpolantAutomatonStates: 125, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 870 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 3974 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1421 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 1646/3630 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:21:39,299 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