./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba5f0caf23a8553b85ea9b0e3b56d4287012b5199113e94bf771c5d2d4836944 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:45:40,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:45:40,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:45:40,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:45:40,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:45:40,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:45:40,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:45:40,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:45:40,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:45:40,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:45:40,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:45:40,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:45:40,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:45:40,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:45:40,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:45:40,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:45:40,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:45:40,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:45:40,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:45:40,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:45:40,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:45:40,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:45:40,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:45:40,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:45:40,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:45:40,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:45:40,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:45:40,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:45:40,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:45:40,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:45:40,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:45:40,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:45:40,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:45:40,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:45:40,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:45:40,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:45:40,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:45:40,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:45:40,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:45:40,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:45:40,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:45:40,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:45:40,344 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 -> ba5f0caf23a8553b85ea9b0e3b56d4287012b5199113e94bf771c5d2d4836944 [2024-10-14 11:45:40,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:45:40,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:45:40,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:45:40,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:45:40,548 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:45:40,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-4.i [2024-10-14 11:45:41,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:45:42,034 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:45:42,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-4.i [2024-10-14 11:45:42,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939291c9c/6281a2a3d77e49319f4f1eaff35ac300/FLAG09b2c4a03 [2024-10-14 11:45:42,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939291c9c/6281a2a3d77e49319f4f1eaff35ac300 [2024-10-14 11:45:42,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:45:42,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:45:42,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:45:42,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:45:42,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:45:42,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec5b9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42, skipping insertion in model container [2024-10-14 11:45:42,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:45:42,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-4.i[914,927] [2024-10-14 11:45:42,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:45:42,254 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:45:42,267 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-4.i[914,927] [2024-10-14 11:45:42,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:45:42,304 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:45:42,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42 WrapperNode [2024-10-14 11:45:42,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:45:42,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:45:42,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:45:42,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:45:42,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,343 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-14 11:45:42,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:45:42,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:45:42,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:45:42,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:45:42,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:45:42,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:45:42,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:45:42,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:45:42,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:45:42,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (1/1) ... [2024-10-14 11:45:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:45:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:45:42,491 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-10-14 11:45:42,494 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-10-14 11:45:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:45:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:45:42,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:45:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:45:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:45:42,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:45:42,605 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:45:42,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:45:42,823 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 11:45:42,823 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:45:42,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:45:42,850 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:45:42,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:42 BoogieIcfgContainer [2024-10-14 11:45:42,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:45:42,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:45:42,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:45:42,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:45:42,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:42" (1/3) ... [2024-10-14 11:45:42,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d978ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:42, skipping insertion in model container [2024-10-14 11:45:42,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:42" (2/3) ... [2024-10-14 11:45:42,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d978ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:42, skipping insertion in model container [2024-10-14 11:45:42,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:42" (3/3) ... [2024-10-14 11:45:42,858 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-4.i [2024-10-14 11:45:42,871 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:45:42,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:45:42,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:45:42,926 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;@5f109f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:45:42,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:45:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:45:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 11:45:42,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:42,939 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:45:42,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:42,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -675294763, now seen corresponding path program 1 times [2024-10-14 11:45:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117566293] [2024-10-14 11:45:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:45:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:45:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:45:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:45:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:45:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:45:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:45:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:45:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:45:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:45:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:45:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:45:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:45:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:45:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117566293] [2024-10-14 11:45:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117566293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:43,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:45:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828937941] [2024-10-14 11:45:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:43,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:45:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:45:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:45:43,286 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 11:45:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:43,329 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2024-10-14 11:45:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:45:43,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2024-10-14 11:45:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:43,339 INFO L225 Difference]: With dead ends: 83 [2024-10-14 11:45:43,339 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 11:45:43,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:45:43,346 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:43,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:45:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 11:45:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 11:45:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:45:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2024-10-14 11:45:43,389 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 92 [2024-10-14 11:45:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:43,389 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2024-10-14 11:45:43,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 11:45:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2024-10-14 11:45:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 11:45:43,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:43,395 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:45:43,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:45:43,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:43,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1670173101, now seen corresponding path program 1 times [2024-10-14 11:45:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342747488] [2024-10-14 11:45:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:43,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:45:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:45:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:45:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:45:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:45:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:45:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:45:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:45:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:45:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:45:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:45:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:45:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:45:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:45:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342747488] [2024-10-14 11:45:45,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342747488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:45,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:45,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:45:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919199143] [2024-10-14 11:45:45,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:45,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:45:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:45,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:45:45,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:45:45,908 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:45:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:46,226 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-14 11:45:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:45:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 92 [2024-10-14 11:45:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:46,228 INFO L225 Difference]: With dead ends: 68 [2024-10-14 11:45:46,229 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 11:45:46,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:45:46,230 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:46,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 171 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:45:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 11:45:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2024-10-14 11:45:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:45:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2024-10-14 11:45:46,241 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 92 [2024-10-14 11:45:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:46,242 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-14 11:45:46,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:45:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2024-10-14 11:45:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:45:46,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:46,247 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:45:46,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:45:46,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:46,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash -245176358, now seen corresponding path program 1 times [2024-10-14 11:45:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017757874] [2024-10-14 11:45:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:45:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:45:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:45:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:45:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:45:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:45:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:45:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:45:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:45:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:45:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:45:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:45:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:45:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:45:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017757874] [2024-10-14 11:45:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017757874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:53,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:53,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:45:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365209528] [2024-10-14 11:45:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:53,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:45:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:45:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:45:53,390 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:45:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:54,096 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2024-10-14 11:45:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:45:54,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2024-10-14 11:45:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:54,098 INFO L225 Difference]: With dead ends: 70 [2024-10-14 11:45:54,098 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 11:45:54,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:45:54,099 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:54,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 240 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:45:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 11:45:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2024-10-14 11:45:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:45:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-14 11:45:54,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2024-10-14 11:45:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:54,105 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-14 11:45:54,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:45:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-14 11:45:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:45:54,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:54,107 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:45:54,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:45:54,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:54,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -245116776, now seen corresponding path program 1 times [2024-10-14 11:45:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889062191] [2024-10-14 11:45:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:45:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:45:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:45:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:45:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:45:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:45:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:45:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:45:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:45:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:45:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:45:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:45:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:45:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:45:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:57,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889062191] [2024-10-14 11:45:57,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889062191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:57,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:57,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:45:57,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76322099] [2024-10-14 11:45:57,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:57,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:45:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:45:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:45:57,827 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:45:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:58,508 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-14 11:45:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:45:58,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2024-10-14 11:45:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:58,510 INFO L225 Difference]: With dead ends: 68 [2024-10-14 11:45:58,511 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 11:45:58,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:45:58,512 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:58,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 192 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 11:45:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 11:45:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2024-10-14 11:45:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:45:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-14 11:45:58,524 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2024-10-14 11:45:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:58,524 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-14 11:45:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:45:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-14 11:45:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:45:58,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:58,527 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:45:58,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:45:58,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:58,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1412692792, now seen corresponding path program 1 times [2024-10-14 11:45:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869084248] [2024-10-14 11:45:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869084248] [2024-10-14 11:46:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869084248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:46:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756650616] [2024-10-14 11:46:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:46:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:46:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:46:00,402 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:00,671 INFO L93 Difference]: Finished difference Result 111 states and 162 transitions. [2024-10-14 11:46:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:46:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2024-10-14 11:46:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:00,672 INFO L225 Difference]: With dead ends: 111 [2024-10-14 11:46:00,672 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 11:46:00,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:46:00,674 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:00,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 204 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:46:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 11:46:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2024-10-14 11:46:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:46:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-14 11:46:00,679 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 93 [2024-10-14 11:46:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-14 11:46:00,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-14 11:46:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:46:00,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:00,681 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:00,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:46:00,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:00,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1469951094, now seen corresponding path program 1 times [2024-10-14 11:46:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:00,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648588381] [2024-10-14 11:46:00,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:02,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648588381] [2024-10-14 11:46:02,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648588381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:02,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:02,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:46:02,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622036279] [2024-10-14 11:46:02,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:46:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:02,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:46:02,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:46:02,303 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:02,550 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2024-10-14 11:46:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:46:02,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2024-10-14 11:46:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:02,552 INFO L225 Difference]: With dead ends: 109 [2024-10-14 11:46:02,552 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 11:46:02,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:46:02,553 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:02,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 198 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:46:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 11:46:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2024-10-14 11:46:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:46:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-14 11:46:02,557 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 93 [2024-10-14 11:46:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:02,558 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-14 11:46:02,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-14 11:46:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:46:02,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:02,559 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:02,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:46:02,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:02,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1717354635, now seen corresponding path program 1 times [2024-10-14 11:46:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245451134] [2024-10-14 11:46:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245451134] [2024-10-14 11:46:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245451134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:46:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922161269] [2024-10-14 11:46:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:46:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:46:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:46:06,569 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:06,917 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2024-10-14 11:46:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:46:06,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2024-10-14 11:46:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:06,920 INFO L225 Difference]: With dead ends: 71 [2024-10-14 11:46:06,920 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 11:46:06,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:46:06,921 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:06,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 302 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:46:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 11:46:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2024-10-14 11:46:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:46:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2024-10-14 11:46:06,930 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 93 [2024-10-14 11:46:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:06,932 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2024-10-14 11:46:06,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2024-10-14 11:46:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 11:46:06,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:06,933 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:06,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:46:06,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:06,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1707803912, now seen corresponding path program 1 times [2024-10-14 11:46:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:06,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884096336] [2024-10-14 11:46:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884096336] [2024-10-14 11:46:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884096336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:46:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106323937] [2024-10-14 11:46:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:46:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:46:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:46:10,770 INFO L87 Difference]: Start difference. First operand 53 states and 78 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:11,271 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-10-14 11:46:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:46:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-14 11:46:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:11,272 INFO L225 Difference]: With dead ends: 71 [2024-10-14 11:46:11,272 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 11:46:11,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:46:11,273 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:46:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 11:46:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2024-10-14 11:46:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:46:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-10-14 11:46:11,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 94 [2024-10-14 11:46:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:11,278 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-10-14 11:46:11,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-10-14 11:46:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 11:46:11,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:11,279 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:11,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:46:11,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1707744330, now seen corresponding path program 1 times [2024-10-14 11:46:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216167494] [2024-10-14 11:46:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:15,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:15,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216167494] [2024-10-14 11:46:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216167494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:15,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:15,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:46:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976206916] [2024-10-14 11:46:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:46:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:46:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:46:15,043 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:15,518 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2024-10-14 11:46:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:46:15,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-14 11:46:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:15,520 INFO L225 Difference]: With dead ends: 66 [2024-10-14 11:46:15,520 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 11:46:15,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:46:15,521 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:15,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 189 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:46:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 11:46:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2024-10-14 11:46:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:46:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-14 11:46:15,526 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 94 [2024-10-14 11:46:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:15,526 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-14 11:46:15,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-14 11:46:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 11:46:15,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:15,527 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:15,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:46:15,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:15,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash -49934762, now seen corresponding path program 1 times [2024-10-14 11:46:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871342240] [2024-10-14 11:46:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:17,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871342240] [2024-10-14 11:46:17,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871342240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:46:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422167104] [2024-10-14 11:46:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:17,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:46:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:46:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:46:17,891 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:18,174 INFO L93 Difference]: Finished difference Result 123 states and 179 transitions. [2024-10-14 11:46:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:46:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-14 11:46:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:18,175 INFO L225 Difference]: With dead ends: 123 [2024-10-14 11:46:18,175 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 11:46:18,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:46:18,176 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:18,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 340 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:46:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 11:46:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2024-10-14 11:46:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 11:46:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-14 11:46:18,181 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 94 [2024-10-14 11:46:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:18,181 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-14 11:46:18,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-14 11:46:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 11:46:18,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:18,182 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:46:18,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 7323540, now seen corresponding path program 1 times [2024-10-14 11:46:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769213305] [2024-10-14 11:46:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:46:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:46:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:46:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:46:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:46:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:46:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:46:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:46:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:46:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:46:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:46:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:46:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:46:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:46:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 11:46:20,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:20,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769213305] [2024-10-14 11:46:20,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769213305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:20,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:20,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:46:20,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718050809] [2024-10-14 11:46:20,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:20,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:46:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:46:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:46:20,915 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:21,159 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2024-10-14 11:46:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:46:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-14 11:46:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:21,160 INFO L225 Difference]: With dead ends: 109 [2024-10-14 11:46:21,160 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 11:46:21,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:46:21,161 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:21,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 286 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:46:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 11:46:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 11:46:21,163 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-10-14 11:46:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 11:46:21,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2024-10-14 11:46:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:21,163 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 11:46:21,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 11:46:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 11:46:21,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 11:46:21,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:46:21,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 11:46:21,168 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:46:21,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 11:46:21,310 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:46:21,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:46:21 BoogieIcfgContainer [2024-10-14 11:46:21,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:46:21,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:46:21,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:46:21,330 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:46:21,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:42" (3/4) ... [2024-10-14 11:46:21,332 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 11:46:21,334 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 11:46:21,337 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 11:46:21,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 11:46:21,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 11:46:21,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 11:46:21,413 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 11:46:21,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 11:46:21,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:46:21,414 INFO L158 Benchmark]: Toolchain (without parser) took 39355.10ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 109.8MB in the beginning and 656.9MB in the end (delta: -547.1MB). Peak memory consumption was 784.3MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,414 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:46:21,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.05ms. Allocated memory is still 180.4MB. Free memory was 109.6MB in the beginning and 96.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.16ms. Allocated memory is still 180.4MB. Free memory was 96.5MB in the beginning and 93.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,415 INFO L158 Benchmark]: Boogie Preprocessor took 72.23ms. Allocated memory is still 180.4MB. Free memory was 93.6MB in the beginning and 150.3MB in the end (delta: -56.7MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,415 INFO L158 Benchmark]: RCFGBuilder took 434.09ms. Allocated memory is still 180.4MB. Free memory was 150.3MB in the beginning and 130.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,415 INFO L158 Benchmark]: TraceAbstraction took 38477.33ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 129.7MB in the beginning and 663.2MB in the end (delta: -533.5MB). Peak memory consumption was 798.1MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,415 INFO L158 Benchmark]: Witness Printer took 84.03ms. Allocated memory is still 1.5GB. Free memory was 663.2MB in the beginning and 656.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,416 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.05ms. Allocated memory is still 180.4MB. Free memory was 109.6MB in the beginning and 96.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.16ms. Allocated memory is still 180.4MB. Free memory was 96.5MB in the beginning and 93.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.23ms. Allocated memory is still 180.4MB. Free memory was 93.6MB in the beginning and 150.3MB in the end (delta: -56.7MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * RCFGBuilder took 434.09ms. Allocated memory is still 180.4MB. Free memory was 150.3MB in the beginning and 130.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38477.33ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 129.7MB in the beginning and 663.2MB in the end (delta: -533.5MB). Peak memory consumption was 798.1MB. Max. memory is 16.1GB. * Witness Printer took 84.03ms. Allocated memory is still 1.5GB. Free memory was 663.2MB in the beginning and 656.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 19]: 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.3s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 2395 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1815 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1356 IncrementalHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 580 mSDtfsCounter, 1356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=8, InterpolantAutomatonStates: 91, 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, 144 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 14227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 4620/4620 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 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((var_1_1 == var_1_6) || (var_1_5 < var_1_6)) || ((last_1_var_1_9 / var_1_3) < last_1_var_1_9)) && (((var_1_6 < (var_1_5 + 1)) || ((last_1_var_1_9 / var_1_3) < last_1_var_1_9)) || (var_1_1 == var_1_5))) || (0 < (((int) var_1_3 + last_1_var_1_9) + 1))) RESULT: Ultimate proved your program to be correct! [2024-10-14 11:46:21,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE