./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_fillercode_fillercodestructure_filler-pe-ci_file-52.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_fillercode_fillercodestructure_filler-pe-ci_file-52.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 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:37:48,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:37:48,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:37:48,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:37:48,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:37:48,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:37:48,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:37:48,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:37:48,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:37:48,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:37:48,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:37:48,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:37:48,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:37:48,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:37:48,537 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:37:48,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:37:48,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:37:48,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:37:48,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:37:48,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:37:48,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:37:48,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:37:48,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:37:48,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:37:48,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:37:48,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:37:48,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:37:48,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:37:48,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:37:48,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:37:48,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:37:48,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:37:48,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:48,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:37:48,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:37:48,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:37:48,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:37:48,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:37:48,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:37:48,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:37:48,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:37:48,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:37:48,547 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 -> 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b [2024-10-13 01:37:48,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:37:48,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:37:48,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:37:48,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:37:48,825 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:37:48,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2024-10-13 01:37:50,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:37:50,471 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:37:50,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2024-10-13 01:37:50,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d61ff322/93f708f3bcdc488ba60c4719f286c501/FLAGef6293943 [2024-10-13 01:37:50,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d61ff322/93f708f3bcdc488ba60c4719f286c501 [2024-10-13 01:37:50,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:37:50,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:37:50,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:50,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:37:50,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:37:50,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:50" (1/1) ... [2024-10-13 01:37:50,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45121737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:50, skipping insertion in model container [2024-10-13 01:37:50,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:50" (1/1) ... [2024-10-13 01:37:50,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:37:51,092 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_fillercode_fillercodestructure_filler-pe-ci_file-52.i[919,932] [2024-10-13 01:37:51,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:51,192 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:37:51,234 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_fillercode_fillercodestructure_filler-pe-ci_file-52.i[919,932] [2024-10-13 01:37:51,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:51,328 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:37:51,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51 WrapperNode [2024-10-13 01:37:51,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:51,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:51,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:37:51,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:37:51,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,383 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-13 01:37:51,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:51,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:37:51,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:37:51,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:37:51,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,411 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 01:37:51,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:37:51,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:37:51,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:37:51,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:37:51,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (1/1) ... [2024-10-13 01:37:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:51,481 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 01:37:51,484 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 01:37:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:37:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:37:51,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:37:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:37:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:37:51,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:37:51,631 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:37:51,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:37:52,089 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-13 01:37:52,090 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:37:52,125 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:37:52,126 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:37:52,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:52 BoogieIcfgContainer [2024-10-13 01:37:52,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:37:52,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:37:52,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:37:52,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:37:52,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:37:50" (1/3) ... [2024-10-13 01:37:52,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f707fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:52, skipping insertion in model container [2024-10-13 01:37:52,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:51" (2/3) ... [2024-10-13 01:37:52,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f707fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:52, skipping insertion in model container [2024-10-13 01:37:52,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:52" (3/3) ... [2024-10-13 01:37:52,134 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2024-10-13 01:37:52,149 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:37:52,149 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:37:52,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:37:52,213 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;@740f796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:37:52,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:37:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 01:37:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 01:37:52,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:52,232 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:52,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:52,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1586327705, now seen corresponding path program 1 times [2024-10-13 01:37:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650571804] [2024-10-13 01:37:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650571804] [2024-10-13 01:37:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650571804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:37:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293688750] [2024-10-13 01:37:52,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:52,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:37:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:37:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:37:52,656 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 01:37:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:52,702 INFO L93 Difference]: Finished difference Result 145 states and 249 transitions. [2024-10-13 01:37:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:37:52,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 121 [2024-10-13 01:37:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:52,743 INFO L225 Difference]: With dead ends: 145 [2024-10-13 01:37:52,743 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 01:37:52,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 01:37:52,758 INFO L432 NwaCegarLoop]: 109 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, 109 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 01:37:52,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 01:37:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 01:37:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 01:37:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2024-10-13 01:37:52,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 121 [2024-10-13 01:37:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:52,863 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2024-10-13 01:37:52,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 01:37:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2024-10-13 01:37:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 01:37:52,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:52,865 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:37:52,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1047291923, now seen corresponding path program 1 times [2024-10-13 01:37:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554748018] [2024-10-13 01:37:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554748018] [2024-10-13 01:37:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554748018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:37:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108014503] [2024-10-13 01:37:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:53,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:37:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:37:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:53,302 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:53,455 INFO L93 Difference]: Finished difference Result 143 states and 223 transitions. [2024-10-13 01:37:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2024-10-13 01:37:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:53,458 INFO L225 Difference]: With dead ends: 143 [2024-10-13 01:37:53,458 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 01:37:53,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:37:53,461 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 141 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:53,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 165 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 01:37:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 01:37:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 01:37:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-13 01:37:53,477 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 121 [2024-10-13 01:37:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:53,478 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-13 01:37:53,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-13 01:37:53,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 01:37:53,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:53,481 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:37:53,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:53,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1181305429, now seen corresponding path program 1 times [2024-10-13 01:37:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293729204] [2024-10-13 01:37:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:53,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293729204] [2024-10-13 01:37:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293729204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:53,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:53,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420989301] [2024-10-13 01:37:53,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:53,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:53,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:53,854 INFO L87 Difference]: Start difference. First operand 72 states and 111 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:54,015 INFO L93 Difference]: Finished difference Result 262 states and 402 transitions. [2024-10-13 01:37:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:54,016 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2024-10-13 01:37:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:54,021 INFO L225 Difference]: With dead ends: 262 [2024-10-13 01:37:54,022 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 01:37:54,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 01:37:54,023 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 151 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:54,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 268 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 01:37:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 141. [2024-10-13 01:37:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 104 states have internal predecessors, (150), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 01:37:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 218 transitions. [2024-10-13 01:37:54,066 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 218 transitions. Word has length 121 [2024-10-13 01:37:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:54,067 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 218 transitions. [2024-10-13 01:37:54,067 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 218 transitions. [2024-10-13 01:37:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 01:37:54,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:54,069 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:37:54,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -474704250, now seen corresponding path program 1 times [2024-10-13 01:37:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845283810] [2024-10-13 01:37:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845283810] [2024-10-13 01:37:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845283810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:37:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979067111] [2024-10-13 01:37:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:54,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:37:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:37:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:54,261 INFO L87 Difference]: Start difference. First operand 141 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:54,428 INFO L93 Difference]: Finished difference Result 453 states and 698 transitions. [2024-10-13 01:37:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:54,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 122 [2024-10-13 01:37:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:54,431 INFO L225 Difference]: With dead ends: 453 [2024-10-13 01:37:54,431 INFO L226 Difference]: Without dead ends: 313 [2024-10-13 01:37:54,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 01:37:54,433 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 240 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:54,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 392 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-13 01:37:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 275. [2024-10-13 01:37:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 202 states have (on average 1.4257425742574257) internal successors, (288), 202 states have internal predecessors, (288), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 01:37:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 424 transitions. [2024-10-13 01:37:54,486 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 424 transitions. Word has length 122 [2024-10-13 01:37:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:54,490 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 424 transitions. [2024-10-13 01:37:54,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 424 transitions. [2024-10-13 01:37:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 01:37:54,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:54,491 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:54,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:37:54,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:54,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -657492830, now seen corresponding path program 1 times [2024-10-13 01:37:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474875281] [2024-10-13 01:37:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474875281] [2024-10-13 01:37:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474875281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:54,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137152040] [2024-10-13 01:37:54,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:54,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:37:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:37:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:54,585 INFO L87 Difference]: Start difference. First operand 275 states and 424 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:54,644 INFO L93 Difference]: Finished difference Result 735 states and 1124 transitions. [2024-10-13 01:37:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:37:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 122 [2024-10-13 01:37:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:54,647 INFO L225 Difference]: With dead ends: 735 [2024-10-13 01:37:54,647 INFO L226 Difference]: Without dead ends: 461 [2024-10-13 01:37:54,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 01:37:54,649 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 67 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:54,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 198 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-13 01:37:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 287. [2024-10-13 01:37:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.411214953271028) internal successors, (302), 214 states have internal predecessors, (302), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 01:37:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 438 transitions. [2024-10-13 01:37:54,692 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 438 transitions. Word has length 122 [2024-10-13 01:37:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 438 transitions. [2024-10-13 01:37:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 438 transitions. [2024-10-13 01:37:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 01:37:54,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:54,697 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:37:54,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:54,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -255849532, now seen corresponding path program 1 times [2024-10-13 01:37:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408069169] [2024-10-13 01:37:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:54,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408069169] [2024-10-13 01:37:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408069169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049797154] [2024-10-13 01:37:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:54,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:54,962 INFO L87 Difference]: Start difference. First operand 287 states and 438 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:55,089 INFO L93 Difference]: Finished difference Result 606 states and 924 transitions. [2024-10-13 01:37:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 122 [2024-10-13 01:37:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:55,092 INFO L225 Difference]: With dead ends: 606 [2024-10-13 01:37:55,092 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 01:37:55,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 01:37:55,093 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 172 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 328 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 01:37:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 157. [2024-10-13 01:37:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 120 states have internal predecessors, (169), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 01:37:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2024-10-13 01:37:55,139 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 122 [2024-10-13 01:37:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:55,139 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2024-10-13 01:37:55,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2024-10-13 01:37:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 01:37:55,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:55,144 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:55,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:37:55,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:55,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1768895878, now seen corresponding path program 1 times [2024-10-13 01:37:55,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:55,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648559720] [2024-10-13 01:37:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:55,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648559720] [2024-10-13 01:37:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648559720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:55,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:55,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404543577] [2024-10-13 01:37:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:55,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:37:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:55,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:37:55,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:55,295 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:55,347 INFO L93 Difference]: Finished difference Result 457 states and 689 transitions. [2024-10-13 01:37:55,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:37:55,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 122 [2024-10-13 01:37:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:55,350 INFO L225 Difference]: With dead ends: 457 [2024-10-13 01:37:55,350 INFO L226 Difference]: Without dead ends: 301 [2024-10-13 01:37:55,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 01:37:55,351 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 95 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:55,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 297 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-13 01:37:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 169. [2024-10-13 01:37:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 132 states have internal predecessors, (185), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 01:37:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2024-10-13 01:37:55,370 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 122 [2024-10-13 01:37:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:55,370 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2024-10-13 01:37:55,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:37:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2024-10-13 01:37:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 01:37:55,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:55,372 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:55,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:37:55,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1987750596, now seen corresponding path program 1 times [2024-10-13 01:37:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245355948] [2024-10-13 01:37:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245355948] [2024-10-13 01:37:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245355948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 01:37:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102706310] [2024-10-13 01:37:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 01:37:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:56,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 01:37:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:37:56,020 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:37:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:56,675 INFO L93 Difference]: Finished difference Result 450 states and 675 transitions. [2024-10-13 01:37:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:37:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 122 [2024-10-13 01:37:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:56,678 INFO L225 Difference]: With dead ends: 450 [2024-10-13 01:37:56,678 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 01:37:56,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:37:56,679 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 267 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:56,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 639 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:37:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 01:37:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2024-10-13 01:37:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 199 states have internal predecessors, (277), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-13 01:37:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2024-10-13 01:37:56,715 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 122 [2024-10-13 01:37:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:56,715 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2024-10-13 01:37:56,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:37:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2024-10-13 01:37:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 01:37:56,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:56,716 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:56,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 01:37:56,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1561620474, now seen corresponding path program 1 times [2024-10-13 01:37:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951255840] [2024-10-13 01:37:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:56,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:37:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:37:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:37:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:37:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:37:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:37:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:37:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:37:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:37:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:37:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:37:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951255840] [2024-10-13 01:37:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951255840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 01:37:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223415850] [2024-10-13 01:37:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 01:37:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:59,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 01:37:59,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:37:59,487 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:01,576 INFO L93 Difference]: Finished difference Result 459 states and 677 transitions. [2024-10-13 01:38:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:38:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 123 [2024-10-13 01:38:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:01,578 INFO L225 Difference]: With dead ends: 459 [2024-10-13 01:38:01,578 INFO L226 Difference]: Without dead ends: 367 [2024-10-13 01:38:01,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2024-10-13 01:38:01,580 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 587 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:01,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 531 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 01:38:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-13 01:38:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 264. [2024-10-13 01:38:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 209 states have (on average 1.4019138755980862) internal successors, (293), 209 states have internal predecessors, (293), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-13 01:38:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 395 transitions. [2024-10-13 01:38:01,605 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 395 transitions. Word has length 123 [2024-10-13 01:38:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 395 transitions. [2024-10-13 01:38:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2024-10-13 01:38:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 01:38:01,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:01,607 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:01,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 01:38:01,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:01,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1819785912, now seen corresponding path program 1 times [2024-10-13 01:38:01,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18165163] [2024-10-13 01:38:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:01,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:02,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18165163] [2024-10-13 01:38:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18165163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 01:38:02,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104643011] [2024-10-13 01:38:02,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:02,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 01:38:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 01:38:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:38:02,228 INFO L87 Difference]: Start difference. First operand 264 states and 395 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:02,691 INFO L93 Difference]: Finished difference Result 493 states and 731 transitions. [2024-10-13 01:38:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:38:02,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 123 [2024-10-13 01:38:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:02,697 INFO L225 Difference]: With dead ends: 493 [2024-10-13 01:38:02,697 INFO L226 Difference]: Without dead ends: 284 [2024-10-13 01:38:02,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:38:02,698 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 232 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:02,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 848 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:38:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-13 01:38:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 231. [2024-10-13 01:38:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.375) internal successors, (242), 176 states have internal predecessors, (242), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-13 01:38:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 344 transitions. [2024-10-13 01:38:02,756 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 344 transitions. Word has length 123 [2024-10-13 01:38:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:02,758 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 344 transitions. [2024-10-13 01:38:02,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 344 transitions. [2024-10-13 01:38:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 01:38:02,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:02,759 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:02,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 01:38:02,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:02,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -999151826, now seen corresponding path program 1 times [2024-10-13 01:38:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948227629] [2024-10-13 01:38:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948227629] [2024-10-13 01:38:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948227629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:38:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668861570] [2024-10-13 01:38:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:02,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:38:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:02,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:38:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:02,984 INFO L87 Difference]: Start difference. First operand 231 states and 344 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:03,199 INFO L93 Difference]: Finished difference Result 530 states and 772 transitions. [2024-10-13 01:38:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:38:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2024-10-13 01:38:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:03,202 INFO L225 Difference]: With dead ends: 530 [2024-10-13 01:38:03,203 INFO L226 Difference]: Without dead ends: 362 [2024-10-13 01:38:03,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:38:03,204 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:03,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 317 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:38:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-13 01:38:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2024-10-13 01:38:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 280 states have (on average 1.3571428571428572) internal successors, (380), 282 states have internal predecessors, (380), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 01:38:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 514 transitions. [2024-10-13 01:38:03,251 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 514 transitions. Word has length 124 [2024-10-13 01:38:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 514 transitions. [2024-10-13 01:38:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 514 transitions. [2024-10-13 01:38:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:38:03,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:03,253 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 01:38:03,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:03,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash -911223059, now seen corresponding path program 1 times [2024-10-13 01:38:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497310056] [2024-10-13 01:38:03,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497310056] [2024-10-13 01:38:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497310056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 01:38:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972016922] [2024-10-13 01:38:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:04,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 01:38:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:04,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 01:38:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:38:04,785 INFO L87 Difference]: Start difference. First operand 358 states and 514 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:38:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:06,200 INFO L93 Difference]: Finished difference Result 748 states and 1070 transitions. [2024-10-13 01:38:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 01:38:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 125 [2024-10-13 01:38:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:06,211 INFO L225 Difference]: With dead ends: 748 [2024-10-13 01:38:06,212 INFO L226 Difference]: Without dead ends: 465 [2024-10-13 01:38:06,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-13 01:38:06,213 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 645 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:06,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 436 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:38:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-13 01:38:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 377. [2024-10-13 01:38:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 299 states have (on average 1.3645484949832776) internal successors, (408), 301 states have internal predecessors, (408), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 01:38:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 542 transitions. [2024-10-13 01:38:06,279 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 542 transitions. Word has length 125 [2024-10-13 01:38:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:06,279 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 542 transitions. [2024-10-13 01:38:06,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:38:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 542 transitions. [2024-10-13 01:38:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:38:06,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:06,280 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:06,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 01:38:06,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2103880559, now seen corresponding path program 1 times [2024-10-13 01:38:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136080124] [2024-10-13 01:38:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136080124] [2024-10-13 01:38:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136080124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:07,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 01:38:07,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476537228] [2024-10-13 01:38:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:08,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 01:38:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:08,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 01:38:08,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:38:08,001 INFO L87 Difference]: Start difference. First operand 377 states and 542 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:09,613 INFO L93 Difference]: Finished difference Result 820 states and 1169 transitions. [2024-10-13 01:38:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:38:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 125 [2024-10-13 01:38:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:09,621 INFO L225 Difference]: With dead ends: 820 [2024-10-13 01:38:09,622 INFO L226 Difference]: Without dead ends: 527 [2024-10-13 01:38:09,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-10-13 01:38:09,623 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 351 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:09,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 647 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 01:38:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-13 01:38:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 389. [2024-10-13 01:38:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 313 states have internal predecessors, (424), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 01:38:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 558 transitions. [2024-10-13 01:38:09,689 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 558 transitions. Word has length 125 [2024-10-13 01:38:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:09,692 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 558 transitions. [2024-10-13 01:38:09,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 558 transitions. [2024-10-13 01:38:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:38:09,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:09,694 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:09,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 01:38:09,694 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:09,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1380733841, now seen corresponding path program 1 times [2024-10-13 01:38:09,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:09,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111363027] [2024-10-13 01:38:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:09,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:09,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 01:38:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111363027] [2024-10-13 01:38:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111363027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:38:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845220075] [2024-10-13 01:38:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:10,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:10,059 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 01:38:10,060 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 01:38:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 01:38:10,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:10,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:38:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845220075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:10,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:38:10,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 01:38:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391266127] [2024-10-13 01:38:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:10,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:38:10,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:10,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:38:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:38:10,222 INFO L87 Difference]: Start difference. First operand 389 states and 558 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:10,262 INFO L93 Difference]: Finished difference Result 539 states and 768 transitions. [2024-10-13 01:38:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:38:10,262 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2024-10-13 01:38:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:10,264 INFO L225 Difference]: With dead ends: 539 [2024-10-13 01:38:10,264 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 01:38:10,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:38:10,265 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:10,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:38:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 01:38:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-13 01:38:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 155 states have internal predecessors, (197), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 281 transitions. [2024-10-13 01:38:10,286 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 281 transitions. Word has length 125 [2024-10-13 01:38:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:10,286 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 281 transitions. [2024-10-13 01:38:10,286 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 281 transitions. [2024-10-13 01:38:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:38:10,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:10,287 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:10,303 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 01:38:10,487 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,SelfDestructingSolverStorable13 [2024-10-13 01:38:10,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1087662457, now seen corresponding path program 1 times [2024-10-13 01:38:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047439074] [2024-10-13 01:38:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047439074] [2024-10-13 01:38:11,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047439074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:11,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:11,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 01:38:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121843827] [2024-10-13 01:38:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:11,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 01:38:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 01:38:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:38:11,104 INFO L87 Difference]: Start difference. First operand 203 states and 281 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:11,560 INFO L93 Difference]: Finished difference Result 389 states and 537 transitions. [2024-10-13 01:38:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:38:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 126 [2024-10-13 01:38:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:11,562 INFO L225 Difference]: With dead ends: 389 [2024-10-13 01:38:11,562 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 01:38:11,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-13 01:38:11,563 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 481 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:11,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 537 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:38:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 01:38:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 205. [2024-10-13 01:38:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.2820512820512822) internal successors, (200), 157 states have internal predecessors, (200), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 284 transitions. [2024-10-13 01:38:11,584 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 284 transitions. Word has length 126 [2024-10-13 01:38:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 284 transitions. [2024-10-13 01:38:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 284 transitions. [2024-10-13 01:38:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:38:11,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:11,586 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:11,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 01:38:11,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1927441161, now seen corresponding path program 1 times [2024-10-13 01:38:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:11,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164740118] [2024-10-13 01:38:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:12,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164740118] [2024-10-13 01:38:12,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164740118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:12,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:12,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 01:38:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370499837] [2024-10-13 01:38:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:12,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 01:38:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 01:38:12,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:38:12,755 INFO L87 Difference]: Start difference. First operand 205 states and 284 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:38:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:13,291 INFO L93 Difference]: Finished difference Result 389 states and 536 transitions. [2024-10-13 01:38:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:38:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2024-10-13 01:38:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:13,294 INFO L225 Difference]: With dead ends: 389 [2024-10-13 01:38:13,294 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 01:38:13,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:38:13,295 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 308 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:13,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 551 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:38:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 01:38:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 201. [2024-10-13 01:38:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 153 states have internal predecessors, (194), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-10-13 01:38:13,316 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 278 transitions. Word has length 126 [2024-10-13 01:38:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:13,316 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-13 01:38:13,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:38:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 278 transitions. [2024-10-13 01:38:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:38:13,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:13,317 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:13,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 01:38:13,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash -135346256, now seen corresponding path program 1 times [2024-10-13 01:38:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:13,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263793789] [2024-10-13 01:38:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263793789] [2024-10-13 01:38:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263793789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 01:38:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639475968] [2024-10-13 01:38:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:13,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:38:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:38:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:38:13,598 INFO L87 Difference]: Start difference. First operand 201 states and 278 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:13,803 INFO L93 Difference]: Finished difference Result 338 states and 471 transitions. [2024-10-13 01:38:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:38:13,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-13 01:38:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:13,805 INFO L225 Difference]: With dead ends: 338 [2024-10-13 01:38:13,805 INFO L226 Difference]: Without dead ends: 205 [2024-10-13 01:38:13,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:38:13,806 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 128 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:13,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:38:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-13 01:38:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-10-13 01:38:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 157 states have internal predecessors, (198), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 282 transitions. [2024-10-13 01:38:13,827 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 282 transitions. Word has length 127 [2024-10-13 01:38:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:13,827 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 282 transitions. [2024-10-13 01:38:13,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2024-10-13 01:38:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:38:13,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:13,828 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:13,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 01:38:13,828 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:13,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1415209934, now seen corresponding path program 1 times [2024-10-13 01:38:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:13,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564509425] [2024-10-13 01:38:13,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:13,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564509425] [2024-10-13 01:38:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564509425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:26,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:26,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-13 01:38:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133956021] [2024-10-13 01:38:26,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:26,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 01:38:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:26,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 01:38:26,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-13 01:38:26,942 INFO L87 Difference]: Start difference. First operand 205 states and 282 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:30,687 INFO L93 Difference]: Finished difference Result 348 states and 471 transitions. [2024-10-13 01:38:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 01:38:30,688 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 127 [2024-10-13 01:38:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:30,690 INFO L225 Difference]: With dead ends: 348 [2024-10-13 01:38:30,690 INFO L226 Difference]: Without dead ends: 346 [2024-10-13 01:38:30,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-10-13 01:38:30,691 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 588 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:30,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 468 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 01:38:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-13 01:38:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 230. [2024-10-13 01:38:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 181 states have (on average 1.270718232044199) internal successors, (230), 182 states have internal predecessors, (230), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 314 transitions. [2024-10-13 01:38:30,742 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 314 transitions. Word has length 127 [2024-10-13 01:38:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:30,742 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 314 transitions. [2024-10-13 01:38:30,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 314 transitions. [2024-10-13 01:38:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:38:30,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:30,743 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:30,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 01:38:30,744 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1919373447, now seen corresponding path program 1 times [2024-10-13 01:38:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742652691] [2024-10-13 01:38:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742652691] [2024-10-13 01:38:36,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742652691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:36,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:36,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 01:38:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862098558] [2024-10-13 01:38:36,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:36,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:38:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:38:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:38:36,123 INFO L87 Difference]: Start difference. First operand 230 states and 314 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:37,672 INFO L93 Difference]: Finished difference Result 300 states and 401 transitions. [2024-10-13 01:38:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:38:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 127 [2024-10-13 01:38:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:37,675 INFO L225 Difference]: With dead ends: 300 [2024-10-13 01:38:37,675 INFO L226 Difference]: Without dead ends: 298 [2024-10-13 01:38:37,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-10-13 01:38:37,679 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 644 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:37,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 443 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 01:38:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-13 01:38:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 244. [2024-10-13 01:38:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.2769230769230768) internal successors, (249), 196 states have internal predecessors, (249), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 333 transitions. [2024-10-13 01:38:37,702 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 333 transitions. Word has length 127 [2024-10-13 01:38:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:37,702 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 333 transitions. [2024-10-13 01:38:37,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 333 transitions. [2024-10-13 01:38:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 01:38:37,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:37,704 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:37,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 01:38:37,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:37,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash 825220428, now seen corresponding path program 1 times [2024-10-13 01:38:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995886921] [2024-10-13 01:38:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995886921] [2024-10-13 01:38:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995886921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 01:38:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417304727] [2024-10-13 01:38:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:46,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 01:38:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 01:38:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-13 01:38:46,593 INFO L87 Difference]: Start difference. First operand 244 states and 333 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:49,523 INFO L93 Difference]: Finished difference Result 405 states and 542 transitions. [2024-10-13 01:38:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:38:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2024-10-13 01:38:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:49,526 INFO L225 Difference]: With dead ends: 405 [2024-10-13 01:38:49,526 INFO L226 Difference]: Without dead ends: 403 [2024-10-13 01:38:49,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2024-10-13 01:38:49,527 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 338 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:49,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 572 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 01:38:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-13 01:38:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 244. [2024-10-13 01:38:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.2769230769230768) internal successors, (249), 196 states have internal predecessors, (249), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 333 transitions. [2024-10-13 01:38:49,556 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 333 transitions. Word has length 128 [2024-10-13 01:38:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:49,556 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 333 transitions. [2024-10-13 01:38:49,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:38:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 333 transitions. [2024-10-13 01:38:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 01:38:49,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:49,557 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:49,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 01:38:49,558 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:49,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 965769038, now seen corresponding path program 1 times [2024-10-13 01:38:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:49,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497846357] [2024-10-13 01:38:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497846357] [2024-10-13 01:38:49,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497846357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:38:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435191577] [2024-10-13 01:38:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:49,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:38:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:38:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:49,821 INFO L87 Difference]: Start difference. First operand 244 states and 333 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:49,924 INFO L93 Difference]: Finished difference Result 474 states and 651 transitions. [2024-10-13 01:38:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:38:49,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-10-13 01:38:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:49,926 INFO L225 Difference]: With dead ends: 474 [2024-10-13 01:38:49,927 INFO L226 Difference]: Without dead ends: 334 [2024-10-13 01:38:49,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:49,927 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 120 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:49,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 277 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:38:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-13 01:38:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 248. [2024-10-13 01:38:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 199 states have (on average 1.2663316582914572) internal successors, (252), 200 states have internal predecessors, (252), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 336 transitions. [2024-10-13 01:38:49,953 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 336 transitions. Word has length 128 [2024-10-13 01:38:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:49,953 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 336 transitions. [2024-10-13 01:38:49,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 01:38:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 336 transitions. [2024-10-13 01:38:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 01:38:49,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:49,954 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:49,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 01:38:49,954 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:49,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1857793192, now seen corresponding path program 1 times [2024-10-13 01:38:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936695376] [2024-10-13 01:38:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:38:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:38:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:38:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:38:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:38:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936695376] [2024-10-13 01:38:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936695376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:58,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:58,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 01:38:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96057453] [2024-10-13 01:38:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:38:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:38:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:38:58,091 INFO L87 Difference]: Start difference. First operand 248 states and 336 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:38:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:59,951 INFO L93 Difference]: Finished difference Result 297 states and 400 transitions. [2024-10-13 01:38:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 01:38:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2024-10-13 01:38:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:59,954 INFO L225 Difference]: With dead ends: 297 [2024-10-13 01:38:59,954 INFO L226 Difference]: Without dead ends: 295 [2024-10-13 01:38:59,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2024-10-13 01:38:59,955 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 371 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:59,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 461 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 01:38:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-13 01:38:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 250. [2024-10-13 01:38:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 201 states have (on average 1.2686567164179106) internal successors, (255), 202 states have internal predecessors, (255), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:38:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 339 transitions. [2024-10-13 01:38:59,983 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 339 transitions. Word has length 128 [2024-10-13 01:38:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 339 transitions. [2024-10-13 01:38:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 01:38:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 339 transitions. [2024-10-13 01:38:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 01:38:59,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:59,985 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:38:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 01:38:59,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:59,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 626677762, now seen corresponding path program 1 times [2024-10-13 01:38:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220773071] [2024-10-13 01:38:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:39:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:39:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:39:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:39:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:39:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:39:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:39:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:39:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:39:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:39:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:39:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:39:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:39:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:39:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:39:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:39:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:39:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:39:04,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:39:04,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220773071] [2024-10-13 01:39:04,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220773071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:04,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:04,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 01:39:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531626653] [2024-10-13 01:39:04,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:04,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 01:39:04,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:39:04,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 01:39:04,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:39:04,168 INFO L87 Difference]: Start difference. First operand 250 states and 339 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:39:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:39:05,605 INFO L93 Difference]: Finished difference Result 301 states and 404 transitions. [2024-10-13 01:39:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:39:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2024-10-13 01:39:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:39:05,608 INFO L225 Difference]: With dead ends: 301 [2024-10-13 01:39:05,608 INFO L226 Difference]: Without dead ends: 299 [2024-10-13 01:39:05,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2024-10-13 01:39:05,609 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 352 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:39:05,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 400 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:39:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-13 01:39:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 249. [2024-10-13 01:39:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 200 states have (on average 1.27) internal successors, (254), 201 states have internal predecessors, (254), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:39:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 338 transitions. [2024-10-13 01:39:05,641 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 338 transitions. Word has length 128 [2024-10-13 01:39:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:39:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 338 transitions. [2024-10-13 01:39:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:39:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2024-10-13 01:39:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 01:39:05,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:05,642 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:39:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 01:39:05,643 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1270606307, now seen corresponding path program 1 times [2024-10-13 01:39:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:39:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837605400] [2024-10-13 01:39:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:39:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:39:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:39:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:39:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:39:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:39:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:39:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:39:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:39:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:39:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:39:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:39:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:39:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:39:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:39:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:39:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:39:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 01:39:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:39:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837605400] [2024-10-13 01:39:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837605400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:11,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 01:39:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143701060] [2024-10-13 01:39:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:39:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:39:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:39:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:39:11,075 INFO L87 Difference]: Start difference. First operand 249 states and 338 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:39:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:39:13,019 INFO L93 Difference]: Finished difference Result 294 states and 393 transitions. [2024-10-13 01:39:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 01:39:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2024-10-13 01:39:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:39:13,022 INFO L225 Difference]: With dead ends: 294 [2024-10-13 01:39:13,022 INFO L226 Difference]: Without dead ends: 292 [2024-10-13 01:39:13,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2024-10-13 01:39:13,023 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 331 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:39:13,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 528 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 01:39:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-13 01:39:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 249. [2024-10-13 01:39:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 200 states have (on average 1.27) internal successors, (254), 201 states have internal predecessors, (254), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 01:39:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 338 transitions. [2024-10-13 01:39:13,060 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 338 transitions. Word has length 128 [2024-10-13 01:39:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:39:13,060 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 338 transitions. [2024-10-13 01:39:13,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-13 01:39:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2024-10-13 01:39:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 01:39:13,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:13,062 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:39:13,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 01:39:13,062 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:13,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 731802328, now seen corresponding path program 1 times [2024-10-13 01:39:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:39:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723656789] [2024-10-13 01:39:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat