./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_variablewrapping_normal_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_variablewrapping_normal_file-89.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 857eb6400730c27462335624c39a58effd99f93ee6f972a1d8a0651a358303ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:52:32,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:52:32,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:52:32,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:52:32,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:52:32,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:52:32,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:52:32,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:52:32,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:52:32,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:52:32,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:52:32,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:52:32,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:52:32,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:52:32,289 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:52:32,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:52:32,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:52:32,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:52:32,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:52:32,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:52:32,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:52:32,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:52:32,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:52:32,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:52:32,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:52:32,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:52:32,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:52:32,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:52:32,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:52:32,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:52:32,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:52:32,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:52:32,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:32,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:52:32,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:52:32,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:52:32,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:52:32,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:52:32,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:52:32,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:52:32,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:52:32,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:52:32,301 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 -> 857eb6400730c27462335624c39a58effd99f93ee6f972a1d8a0651a358303ab [2024-10-13 05:52:32,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:52:32,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:52:32,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:52:32,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:52:32,599 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:52:32,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-89.i [2024-10-13 05:52:34,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:52:34,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:52:34,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-89.i [2024-10-13 05:52:34,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600c13fa9/a0d54172b8df4be8862dcbb0c58a48d3/FLAGe593d8c1a [2024-10-13 05:52:34,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600c13fa9/a0d54172b8df4be8862dcbb0c58a48d3 [2024-10-13 05:52:34,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:52:34,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:52:34,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:34,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:52:34,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:52:34,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4c7b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34, skipping insertion in model container [2024-10-13 05:52:34,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:52:34,468 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_variablewrapping_normal_file-89.i[913,926] [2024-10-13 05:52:34,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:34,510 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:52:34,520 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_variablewrapping_normal_file-89.i[913,926] [2024-10-13 05:52:34,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:34,563 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:52:34,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34 WrapperNode [2024-10-13 05:52:34,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:34,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:34,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:52:34,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:52:34,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,624 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-13 05:52:34,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:34,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:52:34,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:52:34,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:52:34,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,661 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-13 05:52:34,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:52:34,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:52:34,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:52:34,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:52:34,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (1/1) ... [2024-10-13 05:52:34,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:52:34,727 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-13 05:52:34,730 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-13 05:52:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:52:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:52:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:52:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:52:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:52:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:52:34,860 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:52:34,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:52:35,180 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-13 05:52:35,182 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:52:35,221 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:52:35,221 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:52:35,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:35 BoogieIcfgContainer [2024-10-13 05:52:35,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:52:35,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:52:35,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:52:35,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:52:35,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:52:34" (1/3) ... [2024-10-13 05:52:35,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7889ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:35, skipping insertion in model container [2024-10-13 05:52:35,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:34" (2/3) ... [2024-10-13 05:52:35,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7889ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:35, skipping insertion in model container [2024-10-13 05:52:35,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:35" (3/3) ... [2024-10-13 05:52:35,232 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-89.i [2024-10-13 05:52:35,247 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:52:35,247 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:52:35,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:52:35,319 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;@3ed2a31c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:52:35,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:52:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 05:52:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:52:35,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:35,340 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:35,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1045799969, now seen corresponding path program 1 times [2024-10-13 05:52:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550074740] [2024-10-13 05:52:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:35,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:35,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550074740] [2024-10-13 05:52:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550074740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:35,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:52:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460985855] [2024-10-13 05:52:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:52:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:52:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:52:35,750 INFO L87 Difference]: Start difference. First operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 05:52:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:35,792 INFO L93 Difference]: Finished difference Result 111 states and 187 transitions. [2024-10-13 05:52:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:52:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-10-13 05:52:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:35,803 INFO L225 Difference]: With dead ends: 111 [2024-10-13 05:52:35,804 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 05:52:35,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-13 05:52:35,815 INFO L432 NwaCegarLoop]: 78 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, 78 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-13 05:52:35,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:52:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 05:52:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 05:52:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 05:52:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-10-13 05:52:35,856 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 83 [2024-10-13 05:52:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:35,857 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-10-13 05:52:35,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 05:52:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-10-13 05:52:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:52:35,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:35,860 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:35,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:52:35,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1716979615, now seen corresponding path program 1 times [2024-10-13 05:52:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705773975] [2024-10-13 05:52:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705773975] [2024-10-13 05:52:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705773975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:36,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:52:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784789096] [2024-10-13 05:52:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:36,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:52:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:52:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:52:36,619 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:36,857 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2024-10-13 05:52:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:52:36,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2024-10-13 05:52:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:36,860 INFO L225 Difference]: With dead ends: 164 [2024-10-13 05:52:36,860 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 05:52:36,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:52:36,862 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:36,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 266 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:52:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 05:52:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-10-13 05:52:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:52:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-13 05:52:36,891 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 83 [2024-10-13 05:52:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:36,892 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-13 05:52:36,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-13 05:52:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:52:36,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:36,897 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:36,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:52:36,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2110006625, now seen corresponding path program 1 times [2024-10-13 05:52:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635815876] [2024-10-13 05:52:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:36,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:39,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:39,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635815876] [2024-10-13 05:52:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635815876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:39,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:39,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:52:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676999149] [2024-10-13 05:52:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:39,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:52:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:39,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:52:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:52:39,634 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:40,098 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2024-10-13 05:52:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:52:40,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2024-10-13 05:52:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:40,101 INFO L225 Difference]: With dead ends: 162 [2024-10-13 05:52:40,101 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 05:52:40,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:52:40,102 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:40,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 188 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:52:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 05:52:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2024-10-13 05:52:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:52:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-10-13 05:52:40,119 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 83 [2024-10-13 05:52:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:40,119 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-10-13 05:52:40,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-10-13 05:52:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:52:40,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:40,121 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:40,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:52:40,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:40,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1375614045, now seen corresponding path program 1 times [2024-10-13 05:52:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956650094] [2024-10-13 05:52:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956650094] [2024-10-13 05:52:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956650094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:52:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565680862] [2024-10-13 05:52:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:41,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:52:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:41,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:52:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:52:41,998 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:42,424 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-13 05:52:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:52:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2024-10-13 05:52:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:42,429 INFO L225 Difference]: With dead ends: 173 [2024-10-13 05:52:42,429 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 05:52:42,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:52:42,431 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:42,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 189 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:52:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 05:52:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 80. [2024-10-13 05:52:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:52:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2024-10-13 05:52:42,449 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 83 [2024-10-13 05:52:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:42,450 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2024-10-13 05:52:42,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2024-10-13 05:52:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:52:42,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:42,452 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:42,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:52:42,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:42,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1726763130, now seen corresponding path program 1 times [2024-10-13 05:52:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252666254] [2024-10-13 05:52:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252666254] [2024-10-13 05:52:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252666254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:43,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:43,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:52:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587076136] [2024-10-13 05:52:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:43,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:52:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:52:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:52:43,070 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:43,565 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2024-10-13 05:52:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 05:52:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2024-10-13 05:52:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:43,568 INFO L225 Difference]: With dead ends: 196 [2024-10-13 05:52:43,568 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 05:52:43,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:52:43,569 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 168 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:43,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 261 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:52:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 05:52:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-10-13 05:52:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:52:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2024-10-13 05:52:43,590 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 195 transitions. Word has length 85 [2024-10-13 05:52:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:43,590 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 195 transitions. [2024-10-13 05:52:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2024-10-13 05:52:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 05:52:43,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:43,592 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:52:43,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1907132730, now seen corresponding path program 1 times [2024-10-13 05:52:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269832898] [2024-10-13 05:52:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269832898] [2024-10-13 05:52:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269832898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:52:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695127930] [2024-10-13 05:52:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:43,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:52:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:52:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:52:43,748 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:43,862 INFO L93 Difference]: Finished difference Result 260 states and 364 transitions. [2024-10-13 05:52:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:52:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-10-13 05:52:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:43,864 INFO L225 Difference]: With dead ends: 260 [2024-10-13 05:52:43,864 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 05:52:43,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:52:43,865 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:43,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 136 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:52:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 05:52:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-10-13 05:52:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 101 states have internal predecessors, (123), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:52:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2024-10-13 05:52:43,895 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 87 [2024-10-13 05:52:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:43,895 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2024-10-13 05:52:43,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2024-10-13 05:52:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:52:43,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:43,901 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:43,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:52:43,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash -965461757, now seen corresponding path program 1 times [2024-10-13 05:52:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162289093] [2024-10-13 05:52:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162289093] [2024-10-13 05:52:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162289093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:44,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:44,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:52:44,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094021560] [2024-10-13 05:52:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:44,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:52:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:44,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:52:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:52:44,564 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:44,988 INFO L93 Difference]: Finished difference Result 153 states and 209 transitions. [2024-10-13 05:52:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:52:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-10-13 05:52:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:44,990 INFO L225 Difference]: With dead ends: 153 [2024-10-13 05:52:44,990 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 05:52:44,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:52:44,991 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:44,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 334 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:52:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 05:52:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2024-10-13 05:52:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 102 states have internal predecessors, (124), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:52:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 202 transitions. [2024-10-13 05:52:45,010 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 202 transitions. Word has length 88 [2024-10-13 05:52:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:45,010 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 202 transitions. [2024-10-13 05:52:45,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2024-10-13 05:52:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:52:45,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:45,012 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:52:45,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:45,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1500733303, now seen corresponding path program 1 times [2024-10-13 05:52:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:45,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100043604] [2024-10-13 05:52:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100043604] [2024-10-13 05:52:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100043604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:45,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:52:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491927967] [2024-10-13 05:52:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:52:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:45,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:52:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:52:45,097 INFO L87 Difference]: Start difference. First operand 145 states and 202 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:45,150 INFO L93 Difference]: Finished difference Result 320 states and 437 transitions. [2024-10-13 05:52:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:52:45,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-10-13 05:52:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:45,152 INFO L225 Difference]: With dead ends: 320 [2024-10-13 05:52:45,152 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 05:52:45,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:52:45,153 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:45,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:52:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 05:52:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-10-13 05:52:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 139 states have internal predecessors, (162), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 05:52:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2024-10-13 05:52:45,187 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 95 [2024-10-13 05:52:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:45,187 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2024-10-13 05:52:45,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2024-10-13 05:52:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:52:45,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:45,189 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:45,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:52:45,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1510365528, now seen corresponding path program 1 times [2024-10-13 05:52:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982375538] [2024-10-13 05:52:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:46,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982375538] [2024-10-13 05:52:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982375538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:46,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 05:52:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115683587] [2024-10-13 05:52:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:52:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:46,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:52:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:52:46,421 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:47,563 INFO L93 Difference]: Finished difference Result 239 states and 311 transitions. [2024-10-13 05:52:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:52:47,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2024-10-13 05:52:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:47,567 INFO L225 Difference]: With dead ends: 239 [2024-10-13 05:52:47,568 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 05:52:47,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2024-10-13 05:52:47,569 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 149 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:47,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 450 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:52:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 05:52:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2024-10-13 05:52:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 151 states have internal predecessors, (176), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 05:52:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 282 transitions. [2024-10-13 05:52:47,594 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 282 transitions. Word has length 101 [2024-10-13 05:52:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:47,594 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 282 transitions. [2024-10-13 05:52:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 282 transitions. [2024-10-13 05:52:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:52:47,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:47,596 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:52:47,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:52:47,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:47,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash 77982374, now seen corresponding path program 1 times [2024-10-13 05:52:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470826835] [2024-10-13 05:52:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:52:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470826835] [2024-10-13 05:52:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470826835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:52:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602679395] [2024-10-13 05:52:47,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:47,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:52:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:47,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:52:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:52:47,729 INFO L87 Difference]: Start difference. First operand 209 states and 282 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:47,823 INFO L93 Difference]: Finished difference Result 373 states and 505 transitions. [2024-10-13 05:52:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:52:47,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2024-10-13 05:52:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:47,827 INFO L225 Difference]: With dead ends: 373 [2024-10-13 05:52:47,827 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 05:52:47,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:52:47,830 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 39 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:47,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 179 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:52:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 05:52:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-13 05:52:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 134 states have (on average 1.171641791044776) internal successors, (157), 136 states have internal predecessors, (157), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 05:52:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2024-10-13 05:52:47,857 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 101 [2024-10-13 05:52:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:47,857 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2024-10-13 05:52:47,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2024-10-13 05:52:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 05:52:47,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:47,862 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:52:47,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:47,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1897851069, now seen corresponding path program 1 times [2024-10-13 05:52:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616701323] [2024-10-13 05:52:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:47,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-13 05:52:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:48,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616701323] [2024-10-13 05:52:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616701323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:48,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:48,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:52:48,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206502156] [2024-10-13 05:52:48,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:48,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:52:48,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:52:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:52:48,457 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:48,688 INFO L93 Difference]: Finished difference Result 201 states and 269 transitions. [2024-10-13 05:52:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:52:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 172 [2024-10-13 05:52:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:48,691 INFO L225 Difference]: With dead ends: 201 [2024-10-13 05:52:48,692 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 05:52:48,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:52:48,693 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 103 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:48,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 295 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:52:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 05:52:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2024-10-13 05:52:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 131 states have (on average 1.16793893129771) internal successors, (153), 133 states have internal predecessors, (153), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 05:52:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2024-10-13 05:52:48,729 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 172 [2024-10-13 05:52:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2024-10-13 05:52:48,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2024-10-13 05:52:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 05:52:48,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:48,732 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:52:48,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1881337618, now seen corresponding path program 1 times [2024-10-13 05:52:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198894915] [2024-10-13 05:52:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2024-10-13 05:52:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:51,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198894915] [2024-10-13 05:52:51,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198894915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:51,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:51,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 05:52:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164118312] [2024-10-13 05:52:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:51,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:52:51,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:52:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:52:51,161 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:52,068 INFO L93 Difference]: Finished difference Result 371 states and 502 transitions. [2024-10-13 05:52:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:52:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 175 [2024-10-13 05:52:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:52,071 INFO L225 Difference]: With dead ends: 371 [2024-10-13 05:52:52,071 INFO L226 Difference]: Without dead ends: 288 [2024-10-13 05:52:52,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:52:52,072 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:52,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 609 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:52:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-13 05:52:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 271. [2024-10-13 05:52:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 197 states have internal predecessors, (231), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 05:52:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2024-10-13 05:52:52,110 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 175 [2024-10-13 05:52:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:52,111 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2024-10-13 05:52:52,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2024-10-13 05:52:52,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 05:52:52,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:52,113 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:52,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:52:52,113 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:52,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:52,114 INFO L85 PathProgramCache]: Analyzing trace with hash 167130338, now seen corresponding path program 1 times [2024-10-13 05:52:52,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:52,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199634560] [2024-10-13 05:52:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2024-10-13 05:52:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199634560] [2024-10-13 05:52:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199634560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:52,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:52,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:52:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268410511] [2024-10-13 05:52:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:52:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:52:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:52:52,218 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:52,311 INFO L93 Difference]: Finished difference Result 584 states and 799 transitions. [2024-10-13 05:52:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:52:52,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 178 [2024-10-13 05:52:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:52,317 INFO L225 Difference]: With dead ends: 584 [2024-10-13 05:52:52,317 INFO L226 Difference]: Without dead ends: 421 [2024-10-13 05:52:52,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:52:52,318 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:52,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 127 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:52:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-13 05:52:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 276. [2024-10-13 05:52:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 198 states have (on average 1.196969696969697) internal successors, (237), 202 states have internal predecessors, (237), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 05:52:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 375 transitions. [2024-10-13 05:52:52,360 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 375 transitions. Word has length 178 [2024-10-13 05:52:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:52,361 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 375 transitions. [2024-10-13 05:52:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 375 transitions. [2024-10-13 05:52:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 05:52:52,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:52,364 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 05:52:52,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:52:52,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 265665172, now seen corresponding path program 1 times [2024-10-13 05:52:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682087079] [2024-10-13 05:52:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-13 05:52:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682087079] [2024-10-13 05:52:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682087079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:52,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:52,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:52:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385226810] [2024-10-13 05:52:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:52,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:52:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:52,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:52:52,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:52:52,541 INFO L87 Difference]: Start difference. First operand 276 states and 375 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:52,692 INFO L93 Difference]: Finished difference Result 614 states and 837 transitions. [2024-10-13 05:52:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:52:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 181 [2024-10-13 05:52:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:52,696 INFO L225 Difference]: With dead ends: 614 [2024-10-13 05:52:52,698 INFO L226 Difference]: Without dead ends: 446 [2024-10-13 05:52:52,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:52:52,700 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 125 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:52,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 245 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:52:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-13 05:52:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 382. [2024-10-13 05:52:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 264 states have (on average 1.1401515151515151) internal successors, (301), 271 states have internal predecessors, (301), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 05:52:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 511 transitions. [2024-10-13 05:52:52,763 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 511 transitions. Word has length 181 [2024-10-13 05:52:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:52,764 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 511 transitions. [2024-10-13 05:52:52,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 511 transitions. [2024-10-13 05:52:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 05:52:52,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:52,766 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-13 05:52:52,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 05:52:52,767 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:52,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -678963922, now seen corresponding path program 1 times [2024-10-13 05:52:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:52,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846413288] [2024-10-13 05:52:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2024-10-13 05:52:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846413288] [2024-10-13 05:52:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846413288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 05:52:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794046547] [2024-10-13 05:52:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:52:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:52:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:52:55,279 INFO L87 Difference]: Start difference. First operand 382 states and 511 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:56,635 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2024-10-13 05:52:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 05:52:56,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 185 [2024-10-13 05:52:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:56,640 INFO L225 Difference]: With dead ends: 425 [2024-10-13 05:52:56,640 INFO L226 Difference]: Without dead ends: 423 [2024-10-13 05:52:56,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-10-13 05:52:56,644 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 143 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:56,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 755 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:52:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-13 05:52:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 394. [2024-10-13 05:52:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 276 states have (on average 1.141304347826087) internal successors, (315), 283 states have internal predecessors, (315), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 05:52:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 525 transitions. [2024-10-13 05:52:56,729 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 525 transitions. Word has length 185 [2024-10-13 05:52:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:56,729 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 525 transitions. [2024-10-13 05:52:56,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 525 transitions. [2024-10-13 05:52:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 05:52:56,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:56,733 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-13 05:52:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 05:52:56,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 909383980, now seen corresponding path program 1 times [2024-10-13 05:52:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974344226] [2024-10-13 05:52:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-13 05:52:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974344226] [2024-10-13 05:52:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974344226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:56,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:56,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:52:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156704950] [2024-10-13 05:52:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:56,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:52:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:52:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:52:56,968 INFO L87 Difference]: Start difference. First operand 394 states and 525 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:57,213 INFO L93 Difference]: Finished difference Result 729 states and 974 transitions. [2024-10-13 05:52:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:52:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 185 [2024-10-13 05:52:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:57,217 INFO L225 Difference]: With dead ends: 729 [2024-10-13 05:52:57,218 INFO L226 Difference]: Without dead ends: 443 [2024-10-13 05:52:57,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:52:57,219 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 132 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:57,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 285 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:52:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-13 05:52:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 379. [2024-10-13 05:52:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 261 states have (on average 1.1302681992337165) internal successors, (295), 268 states have internal predecessors, (295), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 05:52:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 505 transitions. [2024-10-13 05:52:57,285 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 505 transitions. Word has length 185 [2024-10-13 05:52:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:57,286 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 505 transitions. [2024-10-13 05:52:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:52:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 505 transitions. [2024-10-13 05:52:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-13 05:52:57,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:57,290 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:57,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 05:52:57,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash 434627634, now seen corresponding path program 2 times [2024-10-13 05:52:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124626344] [2024-10-13 05:52:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:52:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:52:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:52:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:52:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:52:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:52:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:52:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:52:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:52:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:52:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:52:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:52:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:52:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:52:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:52:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:52:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:52:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:52:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:52:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 05:52:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 05:52:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 05:52:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 05:52:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 05:52:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 05:52:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 05:52:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 05:52:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 05:52:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 05:52:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 05:52:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 05:52:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 05:52:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 2985 trivial. 0 not checked. [2024-10-13 05:52:59,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:59,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124626344] [2024-10-13 05:52:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124626344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:52:59,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918622598] [2024-10-13 05:52:59,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 05:52:59,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:52:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:52:59,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:52:59,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 05:52:59,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 05:52:59,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 05:52:59,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 05:52:59,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:53:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2024-10-13 05:53:00,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:53:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918622598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:53:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:53:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2024-10-13 05:53:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003273016] [2024-10-13 05:53:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:53:00,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:53:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:53:00,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:53:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-10-13 05:53:00,234 INFO L87 Difference]: Start difference. First operand 379 states and 505 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:53:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:53:01,134 INFO L93 Difference]: Finished difference Result 447 states and 573 transitions. [2024-10-13 05:53:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 05:53:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 259 [2024-10-13 05:53:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:53:01,139 INFO L225 Difference]: With dead ends: 447 [2024-10-13 05:53:01,139 INFO L226 Difference]: Without dead ends: 445 [2024-10-13 05:53:01,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 05:53:01,141 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 167 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:53:01,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 383 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:53:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-13 05:53:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 376. [2024-10-13 05:53:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 258 states have (on average 1.127906976744186) internal successors, (291), 265 states have internal predecessors, (291), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 05:53:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 501 transitions. [2024-10-13 05:53:01,204 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 501 transitions. Word has length 259 [2024-10-13 05:53:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:53:01,204 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 501 transitions. [2024-10-13 05:53:01,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:53:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 501 transitions. [2024-10-13 05:53:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-13 05:53:01,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:53:01,208 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:53:01,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 05:53:01,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 05:53:01,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:53:01,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:53:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -595774367, now seen corresponding path program 1 times [2024-10-13 05:53:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:53:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092579333] [2024-10-13 05:53:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:53:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:53:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:53:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:53:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:53:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:53:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:53:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:53:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:53:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:53:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:53:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:53:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:53:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:53:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:53:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:53:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:53:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:53:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:53:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:53:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:53:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:53:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:53:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:53:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:53:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:53:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:53:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:53:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 05:53:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 05:53:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 05:53:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 05:53:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 05:53:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 05:53:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 05:53:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 05:53:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 05:53:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 05:53:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 05:53:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 05:53:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 05:53:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3046 trivial. 0 not checked. [2024-10-13 05:53:01,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:53:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092579333] [2024-10-13 05:53:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092579333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:53:01,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:53:01,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:53:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877523158] [2024-10-13 05:53:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:53:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:53:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:53:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:53:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:53:01,547 INFO L87 Difference]: Start difference. First operand 376 states and 501 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:53:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:53:01,668 INFO L93 Difference]: Finished difference Result 745 states and 997 transitions. [2024-10-13 05:53:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:53:01,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 264 [2024-10-13 05:53:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:53:01,673 INFO L225 Difference]: With dead ends: 745 [2024-10-13 05:53:01,673 INFO L226 Difference]: Without dead ends: 477 [2024-10-13 05:53:01,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:53:01,676 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:53:01,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 180 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:53:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-13 05:53:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-10-13 05:53:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 319 states have (on average 1.115987460815047) internal successors, (356), 329 states have internal predecessors, (356), 141 states have call successors, (141), 16 states have call predecessors, (141), 16 states have return successors, (141), 131 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-13 05:53:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 638 transitions. [2024-10-13 05:53:01,765 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 638 transitions. Word has length 264 [2024-10-13 05:53:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:53:01,766 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 638 transitions. [2024-10-13 05:53:01,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:53:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 638 transitions. [2024-10-13 05:53:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-13 05:53:01,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:53:01,770 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:53:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 05:53:01,770 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:53:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:53:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -383360142, now seen corresponding path program 2 times [2024-10-13 05:53:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:53:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762519710] [2024-10-13 05:53:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:53:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:53:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:53:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:53:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:53:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:53:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:53:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:53:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:53:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:53:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:53:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:53:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:53:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:53:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:53:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:53:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:53:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:53:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:53:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:53:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:53:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:53:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 05:53:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 05:53:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 05:53:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 05:53:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 05:53:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 05:53:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 05:53:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 05:53:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 05:53:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 05:53:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 05:53:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 05:53:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 05:53:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 05:53:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 05:53:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 05:53:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 05:53:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 05:53:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 05:53:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 2978 trivial. 0 not checked. [2024-10-13 05:53:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:53:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762519710] [2024-10-13 05:53:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762519710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:53:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039905601] [2024-10-13 05:53:03,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 05:53:03,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:53:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:53:03,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:53:03,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:53:03,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 05:53:03,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 05:53:03,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 05:53:03,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:53:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2024-10-13 05:53:04,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:53:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039905601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:53:04,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:53:04,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2024-10-13 05:53:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824702260] [2024-10-13 05:53:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:53:04,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 05:53:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:53:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 05:53:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2024-10-13 05:53:04,703 INFO L87 Difference]: Start difference. First operand 477 states and 638 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:53:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:53:05,501 INFO L93 Difference]: Finished difference Result 568 states and 715 transitions. [2024-10-13 05:53:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:53:05,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 269 [2024-10-13 05:53:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:53:05,503 INFO L225 Difference]: With dead ends: 568 [2024-10-13 05:53:05,503 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 05:53:05,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 05:53:05,506 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 98 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:53:05,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 559 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:53:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 05:53:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 05:53:05,507 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-13 05:53:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 05:53:05,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2024-10-13 05:53:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:53:05,507 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 05:53:05,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:53:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 05:53:05,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 05:53:05,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:53:05,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 05:53:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:53:05,714 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:53:05,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 05:53:40,211 WARN L286 SmtUtils]: Spent 34.37s on a formula simplification. DAG size of input: 293 DAG size of output: 376 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-13 05:53:47,302 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:53:47,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:53:47 BoogieIcfgContainer [2024-10-13 05:53:47,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:53:47,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:53:47,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:53:47,327 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:53:47,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:35" (3/4) ... [2024-10-13 05:53:47,331 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 05:53:47,335 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 05:53:47,341 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 05:53:47,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 05:53:47,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 05:53:47,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 05:53:47,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 05:53:47,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 05:53:47,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:53:47,453 INFO L158 Benchmark]: Toolchain (without parser) took 73169.42ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 924.8MB). Free memory was 129.7MB in the beginning and 944.1MB in the end (delta: -814.4MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,453 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:53:47,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.50ms. Allocated memory is still 163.6MB. Free memory was 129.7MB in the beginning and 115.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.52ms. Allocated memory is still 163.6MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,454 INFO L158 Benchmark]: Boogie Preprocessor took 64.26ms. Allocated memory is still 163.6MB. Free memory was 112.5MB in the beginning and 108.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,454 INFO L158 Benchmark]: RCFGBuilder took 529.34ms. Allocated memory is still 163.6MB. Free memory was 108.9MB in the beginning and 118.2MB in the end (delta: -9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,454 INFO L158 Benchmark]: TraceAbstraction took 72101.62ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 924.8MB). Free memory was 117.1MB in the beginning and 949.3MB in the end (delta: -832.2MB). Peak memory consumption was 645.2MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,454 INFO L158 Benchmark]: Witness Printer took 125.53ms. Allocated memory is still 1.1GB. Free memory was 949.3MB in the beginning and 944.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 05:53:47,456 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.50ms. Allocated memory is still 163.6MB. Free memory was 129.7MB in the beginning and 115.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.52ms. Allocated memory is still 163.6MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.26ms. Allocated memory is still 163.6MB. Free memory was 112.5MB in the beginning and 108.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 529.34ms. Allocated memory is still 163.6MB. Free memory was 108.9MB in the beginning and 118.2MB in the end (delta: -9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 72101.62ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 924.8MB). Free memory was 117.1MB in the beginning and 949.3MB in the end (delta: -832.2MB). Peak memory consumption was 645.2MB. Max. memory is 16.1GB. * Witness Printer took 125.53ms. Allocated memory is still 1.1GB. Free memory was 949.3MB in the beginning and 944.1MB in the end (delta: 5.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, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 19, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1700 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1700 mSDsluCounter, 5666 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3937 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5095 IncrementalHoareTripleChecker+Invalid, 5324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 1729 mSDtfsCounter, 5095 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1608 GetRequests, 1402 SyntacticMatches, 3 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=18, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 517 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 3285 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3264 ConstructedInterpolants, 0 QuantifiedInterpolants, 13747 SizeOfPredicates, 22 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 26379/26396 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: 97]: Loop Invariant Derived loop invariant: (((((((((var_1_8 != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((3 + var_1_10) < var_1_9) || (var_1_8 == ((252 + var_1_9) % 256))) && (((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)) <= 127))) && ((var_1_8 == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((((3 + var_1_10) < var_1_9) || ((256 + var_1_8) == ((252 + var_1_9) % 256))) && (128 <= ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) || ((256 + var_1_8) != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) && (((((var_1_9 <= (3 + var_1_10)) && ((256 + var_1_8) == ((252 + var_1_9) % 256))) || (((252 + var_1_9) % 256) < 128)) && ((127 < ((252 + var_1_9) % 256)) || ((var_1_8 == ((252 + var_1_9) % 256)) && (var_1_9 <= (3 + var_1_10))))) || ((256 + var_1_8) == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))))))) || (last_1_var_1_14 < (last_1_var_1_15 + 1))) && (var_1_13 == var_1_10)) && (var_1_8 == var_1_14)) && (var_1_15 == var_1_3)) && (((var_1_1 == 1) && (var_1_5 != 0)) || (var_1_1 == 0))) || ((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && ((var_1_7 == 0) || (var_1_5 == 0))) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && ((var_1_8 + 1) == 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((var_1_1 == 1) || (var_1_1 == 0)) && (var_1_8 == var_1_14)) || (((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && ((var_1_8 + 1) == 0))) Ensures: ((((var_1_1 == 1) || (var_1_1 == 0)) && (var_1_8 == var_1_14)) || (((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && ((var_1_8 + 1) == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 05:53:47,576 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