./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_operatoramount_amount100_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:09:35,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:09:35,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:09:35,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:09:35,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:09:35,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:09:35,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:09:35,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:09:35,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:09:35,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:09:35,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:09:35,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:09:35,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:09:35,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:09:35,504 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:09:35,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:09:35,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:09:35,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:09:35,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:09:35,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:09:35,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:09:35,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:09:35,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:09:35,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:09:35,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:09:35,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:09:35,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:09:35,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:09:35,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:09:35,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:09:35,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:09:35,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:09:35,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:09:35,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:09:35,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:09:35,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:09:35,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:09:35,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:09:35,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:09:35,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:09:35,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:09:35,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:09:35,520 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-clean/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-clean/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 -> 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 [2024-10-11 12:09:35,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:09:35,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:09:35,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:09:35,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:09:35,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:09:35,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2024-10-11 12:09:37,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:09:37,769 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:09:37,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2024-10-11 12:09:37,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a32212b7d/7387f0a351194876a7c5cde44dc40176/FLAG3d35f2f4a [2024-10-11 12:09:37,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a32212b7d/7387f0a351194876a7c5cde44dc40176 [2024-10-11 12:09:37,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:09:37,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:09:37,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:09:37,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:09:37,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:09:37,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:09:37" (1/1) ... [2024-10-11 12:09:37,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3520033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:37, skipping insertion in model container [2024-10-11 12:09:37,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:09:37" (1/1) ... [2024-10-11 12:09:37,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:09:38,042 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_operatoramount_amount100_file-31.i[916,929] [2024-10-11 12:09:38,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:09:38,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:09:38,153 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_operatoramount_amount100_file-31.i[916,929] [2024-10-11 12:09:38,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:09:38,220 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:09:38,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38 WrapperNode [2024-10-11 12:09:38,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:09:38,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:09:38,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:09:38,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:09:38,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,306 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-10-11 12:09:38,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:09:38,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:09:38,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:09:38,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:09:38,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,354 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-11 12:09:38,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:09:38,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:09:38,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:09:38,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:09:38,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (1/1) ... [2024-10-11 12:09:38,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:09:38,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:09:38,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:09:38,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:09:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:09:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:09:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:09:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:09:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:09:38,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:09:38,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:09:38,590 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:09:39,171 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-11 12:09:39,172 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:09:39,236 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:09:39,236 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:09:39,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:09:39 BoogieIcfgContainer [2024-10-11 12:09:39,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:09:39,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:09:39,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:09:39,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:09:39,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:09:37" (1/3) ... [2024-10-11 12:09:39,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7786d949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:09:39, skipping insertion in model container [2024-10-11 12:09:39,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:38" (2/3) ... [2024-10-11 12:09:39,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7786d949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:09:39, skipping insertion in model container [2024-10-11 12:09:39,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:09:39" (3/3) ... [2024-10-11 12:09:39,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-31.i [2024-10-11 12:09:39,267 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:09:39,267 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:09:39,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:09:39,336 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;@bf27d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:09:39,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:09:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:09:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 12:09:39,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:39,354 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:39,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:39,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1358549390, now seen corresponding path program 1 times [2024-10-11 12:09:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411669415] [2024-10-11 12:09:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:40,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:40,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411669415] [2024-10-11 12:09:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411669415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:40,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:40,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:09:40,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787816676] [2024-10-11 12:09:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:40,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:09:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:40,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:09:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:09:40,083 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:09:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:40,154 INFO L93 Difference]: Finished difference Result 189 states and 329 transitions. [2024-10-11 12:09:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:09:40,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-10-11 12:09:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:40,170 INFO L225 Difference]: With dead ends: 189 [2024-10-11 12:09:40,170 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 12:09:40,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-11 12:09:40,182 INFO L432 NwaCegarLoop]: 136 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, 136 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-11 12:09:40,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:09:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 12:09:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 12:09:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:09:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-10-11 12:09:40,249 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 169 [2024-10-11 12:09:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:40,250 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-10-11 12:09:40,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:09:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2024-10-11 12:09:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 12:09:40,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:40,258 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:09:40,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1267394090, now seen corresponding path program 1 times [2024-10-11 12:09:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696976300] [2024-10-11 12:09:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:40,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:41,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696976300] [2024-10-11 12:09:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696976300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:41,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:41,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:09:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279517486] [2024-10-11 12:09:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:41,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:09:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:41,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:09:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:09:41,296 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:41,564 INFO L93 Difference]: Finished difference Result 265 states and 414 transitions. [2024-10-11 12:09:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:09:41,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-11 12:09:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:41,570 INFO L225 Difference]: With dead ends: 265 [2024-10-11 12:09:41,572 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 12:09:41,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-11 12:09:41,577 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 104 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:41,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 388 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:09:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 12:09:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2024-10-11 12:09:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 12:09:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2024-10-11 12:09:41,617 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 169 [2024-10-11 12:09:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:41,620 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2024-10-11 12:09:41,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2024-10-11 12:09:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 12:09:41,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:41,627 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:09:41,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:41,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash 337176754, now seen corresponding path program 1 times [2024-10-11 12:09:41,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:41,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220669784] [2024-10-11 12:09:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:42,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220669784] [2024-10-11 12:09:42,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220669784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:42,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:42,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:09:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458535192] [2024-10-11 12:09:42,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:09:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:42,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:09:42,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:09:42,198 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:42,452 INFO L93 Difference]: Finished difference Result 275 states and 426 transitions. [2024-10-11 12:09:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:09:42,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 12:09:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:42,456 INFO L225 Difference]: With dead ends: 275 [2024-10-11 12:09:42,458 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 12:09:42,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-11 12:09:42,461 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 85 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:42,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 374 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:09:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 12:09:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2024-10-11 12:09:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 12:09:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2024-10-11 12:09:42,496 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 170 [2024-10-11 12:09:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:42,497 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2024-10-11 12:09:42,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2024-10-11 12:09:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 12:09:42,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:42,504 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:42,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:09:42,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 346789300, now seen corresponding path program 1 times [2024-10-11 12:09:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:42,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748809667] [2024-10-11 12:09:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:42,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748809667] [2024-10-11 12:09:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748809667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:42,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:42,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:09:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475966396] [2024-10-11 12:09:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:09:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:09:42,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:09:42,945 INFO L87 Difference]: Start difference. First operand 152 states and 235 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:43,146 INFO L93 Difference]: Finished difference Result 275 states and 425 transitions. [2024-10-11 12:09:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:09:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 12:09:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:43,149 INFO L225 Difference]: With dead ends: 275 [2024-10-11 12:09:43,150 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 12:09:43,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-11 12:09:43,152 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 83 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:43,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 376 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:09:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 12:09:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2024-10-11 12:09:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 12:09:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 234 transitions. [2024-10-11 12:09:43,184 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 234 transitions. Word has length 171 [2024-10-11 12:09:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:43,185 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 234 transitions. [2024-10-11 12:09:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 234 transitions. [2024-10-11 12:09:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 12:09:43,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:43,188 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:43,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:09:43,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:43,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1278830965, now seen corresponding path program 1 times [2024-10-11 12:09:43,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176197468] [2024-10-11 12:09:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176197468] [2024-10-11 12:09:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176197468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:43,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:09:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182893973] [2024-10-11 12:09:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:43,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:09:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:09:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:09:43,627 INFO L87 Difference]: Start difference. First operand 152 states and 234 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:43,889 INFO L93 Difference]: Finished difference Result 366 states and 562 transitions. [2024-10-11 12:09:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 12:09:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 12:09:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:43,893 INFO L225 Difference]: With dead ends: 366 [2024-10-11 12:09:43,893 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 12:09:43,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:09:43,895 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 172 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:43,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 582 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:09:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 12:09:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 224. [2024-10-11 12:09:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 12:09:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 344 transitions. [2024-10-11 12:09:43,934 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 344 transitions. Word has length 172 [2024-10-11 12:09:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:43,936 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 344 transitions. [2024-10-11 12:09:43,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 344 transitions. [2024-10-11 12:09:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 12:09:43,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:43,939 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:09:43,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:43,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 257762611, now seen corresponding path program 1 times [2024-10-11 12:09:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829917482] [2024-10-11 12:09:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:44,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829917482] [2024-10-11 12:09:44,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829917482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:09:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415712897] [2024-10-11 12:09:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:09:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:09:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:09:44,744 INFO L87 Difference]: Start difference. First operand 224 states and 344 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:09:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:45,375 INFO L93 Difference]: Finished difference Result 438 states and 662 transitions. [2024-10-11 12:09:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:09:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-10-11 12:09:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:45,382 INFO L225 Difference]: With dead ends: 438 [2024-10-11 12:09:45,382 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 12:09:45,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:09:45,385 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 350 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:45,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 682 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:09:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 12:09:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2024-10-11 12:09:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 185 states have internal predecessors, (242), 84 states have call successors, (84), 6 states have call predecessors, (84), 6 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 12:09:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 410 transitions. [2024-10-11 12:09:45,450 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 410 transitions. Word has length 172 [2024-10-11 12:09:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:45,451 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 410 transitions. [2024-10-11 12:09:45,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:09:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 410 transitions. [2024-10-11 12:09:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 12:09:45,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:45,453 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:45,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:09:45,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:45,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash 515928049, now seen corresponding path program 1 times [2024-10-11 12:09:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:45,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900097227] [2024-10-11 12:09:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900097227] [2024-10-11 12:09:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900097227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 12:09:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150253496] [2024-10-11 12:09:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:50,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:09:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:09:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:09:50,688 INFO L87 Difference]: Start difference. First operand 274 states and 410 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:52,688 INFO L93 Difference]: Finished difference Result 587 states and 869 transitions. [2024-10-11 12:09:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 12:09:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 12:09:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:52,696 INFO L225 Difference]: With dead ends: 587 [2024-10-11 12:09:52,696 INFO L226 Difference]: Without dead ends: 411 [2024-10-11 12:09:52,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 12:09:52,701 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:52,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 734 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 12:09:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-11 12:09:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 361. [2024-10-11 12:09:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 249 states have (on average 1.321285140562249) internal successors, (329), 253 states have internal predecessors, (329), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 12:09:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2024-10-11 12:09:52,761 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 533 transitions. Word has length 172 [2024-10-11 12:09:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:52,761 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 533 transitions. [2024-10-11 12:09:52,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 533 transitions. [2024-10-11 12:09:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 12:09:52,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:52,764 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:52,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:09:52,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1195986419, now seen corresponding path program 1 times [2024-10-11 12:09:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044098385] [2024-10-11 12:09:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:09:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:09:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:09:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:09:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:09:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:09:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:09:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:09:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:09:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:09:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:09:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:09:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:09:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:09:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044098385] [2024-10-11 12:09:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044098385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:09:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573031854] [2024-10-11 12:09:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:53,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:09:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:53,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:09:53,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:09:53,395 INFO L87 Difference]: Start difference. First operand 361 states and 533 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:53,945 INFO L93 Difference]: Finished difference Result 741 states and 1100 transitions. [2024-10-11 12:09:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:09:53,946 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 12:09:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:53,952 INFO L225 Difference]: With dead ends: 741 [2024-10-11 12:09:53,952 INFO L226 Difference]: Without dead ends: 472 [2024-10-11 12:09:53,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:09:53,954 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 307 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:53,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 642 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:09:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-11 12:09:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 449. [2024-10-11 12:09:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 287 states have (on average 1.2752613240418118) internal successors, (366), 291 states have internal predecessors, (366), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:09:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 662 transitions. [2024-10-11 12:09:54,022 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 662 transitions. Word has length 172 [2024-10-11 12:09:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:54,023 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 662 transitions. [2024-10-11 12:09:54,023 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 662 transitions. [2024-10-11 12:09:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 12:09:54,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:54,026 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:09:54,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:09:54,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:54,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash 47860979, now seen corresponding path program 1 times [2024-10-11 12:09:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:54,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976003618] [2024-10-11 12:09:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:03,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976003618] [2024-10-11 12:10:03,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976003618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:03,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:03,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 12:10:03,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291982693] [2024-10-11 12:10:03,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:03,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:10:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:10:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:10:03,115 INFO L87 Difference]: Start difference. First operand 449 states and 662 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:06,080 INFO L93 Difference]: Finished difference Result 828 states and 1215 transitions. [2024-10-11 12:10:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 12:10:06,081 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 12:10:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:06,087 INFO L225 Difference]: With dead ends: 828 [2024-10-11 12:10:06,087 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 12:10:06,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-10-11 12:10:06,091 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 419 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:06,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1225 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 12:10:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 12:10:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 449. [2024-10-11 12:10:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 287 states have (on average 1.2752613240418118) internal successors, (366), 291 states have internal predecessors, (366), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:10:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 662 transitions. [2024-10-11 12:10:06,157 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 662 transitions. Word has length 172 [2024-10-11 12:10:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:06,157 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 662 transitions. [2024-10-11 12:10:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 662 transitions. [2024-10-11 12:10:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 12:10:06,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:06,162 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:10:06,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 569660348, now seen corresponding path program 1 times [2024-10-11 12:10:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220325410] [2024-10-11 12:10:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220325410] [2024-10-11 12:10:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220325410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:10:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547873466] [2024-10-11 12:10:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:10:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:10:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:10:09,594 INFO L87 Difference]: Start difference. First operand 449 states and 662 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:10,457 INFO L93 Difference]: Finished difference Result 910 states and 1330 transitions. [2024-10-11 12:10:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:10:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 12:10:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:10,462 INFO L225 Difference]: With dead ends: 910 [2024-10-11 12:10:10,462 INFO L226 Difference]: Without dead ends: 550 [2024-10-11 12:10:10,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:10:10,465 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 120 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:10,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 564 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:10:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-11 12:10:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 460. [2024-10-11 12:10:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 298 states have (on average 1.2684563758389262) internal successors, (378), 302 states have internal predecessors, (378), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:10:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 674 transitions. [2024-10-11 12:10:10,539 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 674 transitions. Word has length 173 [2024-10-11 12:10:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:10,539 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 674 transitions. [2024-10-11 12:10:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 674 transitions. [2024-10-11 12:10:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 12:10:10,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:10,542 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:10:10,542 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -253542364, now seen corresponding path program 1 times [2024-10-11 12:10:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583847548] [2024-10-11 12:10:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583847548] [2024-10-11 12:10:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583847548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:14,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 12:10:14,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162822820] [2024-10-11 12:10:14,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 12:10:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:14,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 12:10:14,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:10:14,864 INFO L87 Difference]: Start difference. First operand 460 states and 674 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:16,470 INFO L93 Difference]: Finished difference Result 945 states and 1367 transitions. [2024-10-11 12:10:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 12:10:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 12:10:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:16,476 INFO L225 Difference]: With dead ends: 945 [2024-10-11 12:10:16,477 INFO L226 Difference]: Without dead ends: 647 [2024-10-11 12:10:16,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-10-11 12:10:16,479 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 177 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:16,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 559 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:10:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-11 12:10:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 488. [2024-10-11 12:10:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 326 states have (on average 1.2975460122699387) internal successors, (423), 330 states have internal predecessors, (423), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:10:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 719 transitions. [2024-10-11 12:10:16,559 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 719 transitions. Word has length 173 [2024-10-11 12:10:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:16,561 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 719 transitions. [2024-10-11 12:10:16,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 719 transitions. [2024-10-11 12:10:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 12:10:16,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:16,564 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:16,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 12:10:16,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1521464998, now seen corresponding path program 1 times [2024-10-11 12:10:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540013194] [2024-10-11 12:10:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540013194] [2024-10-11 12:10:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540013194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:19,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:19,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 12:10:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821779419] [2024-10-11 12:10:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:19,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 12:10:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:19,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 12:10:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:10:19,184 INFO L87 Difference]: Start difference. First operand 488 states and 719 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:20,117 INFO L93 Difference]: Finished difference Result 875 states and 1288 transitions. [2024-10-11 12:10:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:10:20,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 12:10:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:20,122 INFO L225 Difference]: With dead ends: 875 [2024-10-11 12:10:20,122 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 12:10:20,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2024-10-11 12:10:20,125 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 497 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:20,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 750 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:10:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 12:10:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 495. [2024-10-11 12:10:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 333 states have (on average 1.3003003003003002) internal successors, (433), 337 states have internal predecessors, (433), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:10:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 729 transitions. [2024-10-11 12:10:20,204 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 729 transitions. Word has length 173 [2024-10-11 12:10:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:20,205 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 729 transitions. [2024-10-11 12:10:20,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 729 transitions. [2024-10-11 12:10:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 12:10:20,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:20,209 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:20,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 12:10:20,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:20,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1485692636, now seen corresponding path program 1 times [2024-10-11 12:10:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:20,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583889008] [2024-10-11 12:10:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583889008] [2024-10-11 12:10:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583889008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:21,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:10:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411005840] [2024-10-11 12:10:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:10:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:10:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:10:21,530 INFO L87 Difference]: Start difference. First operand 495 states and 729 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:22,592 INFO L93 Difference]: Finished difference Result 920 states and 1356 transitions. [2024-10-11 12:10:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:10:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 12:10:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:22,599 INFO L225 Difference]: With dead ends: 920 [2024-10-11 12:10:22,599 INFO L226 Difference]: Without dead ends: 532 [2024-10-11 12:10:22,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-11 12:10:22,602 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 335 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:22,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 774 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 12:10:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-11 12:10:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 492. [2024-10-11 12:10:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 330 states have (on average 1.293939393939394) internal successors, (427), 334 states have internal predecessors, (427), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:10:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 723 transitions. [2024-10-11 12:10:22,678 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 723 transitions. Word has length 173 [2024-10-11 12:10:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:22,679 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 723 transitions. [2024-10-11 12:10:22,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 723 transitions. [2024-10-11 12:10:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 12:10:22,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:22,681 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 12:10:22,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1878719646, now seen corresponding path program 1 times [2024-10-11 12:10:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072648801] [2024-10-11 12:10:22,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072648801] [2024-10-11 12:10:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072648801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 12:10:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302751780] [2024-10-11 12:10:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 12:10:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:27,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 12:10:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:10:27,457 INFO L87 Difference]: Start difference. First operand 492 states and 723 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:10:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:33,698 INFO L93 Difference]: Finished difference Result 1276 states and 1815 transitions. [2024-10-11 12:10:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 12:10:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-10-11 12:10:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:33,710 INFO L225 Difference]: With dead ends: 1276 [2024-10-11 12:10:33,711 INFO L226 Difference]: Without dead ends: 960 [2024-10-11 12:10:33,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 12:10:33,714 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 349 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:33,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1055 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 12:10:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-11 12:10:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 568. [2024-10-11 12:10:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 429 states have (on average 1.3566433566433567) internal successors, (582), 433 states have internal predecessors, (582), 122 states have call successors, (122), 16 states have call predecessors, (122), 16 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-11 12:10:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 826 transitions. [2024-10-11 12:10:33,803 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 826 transitions. Word has length 173 [2024-10-11 12:10:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:33,804 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 826 transitions. [2024-10-11 12:10:33,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:10:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 826 transitions. [2024-10-11 12:10:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 12:10:33,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:33,806 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 12:10:33,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:33,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash -103712284, now seen corresponding path program 1 times [2024-10-11 12:10:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:33,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152180278] [2024-10-11 12:10:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:10:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:10:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:10:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:10:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:10:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:10:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:10:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:10:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:10:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:10:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:10:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:10:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:10:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:10:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:10:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:10:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:10:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:10:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:10:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:10:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 12:10:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:10:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 12:10:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:10:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:10:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:10:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:10:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152180278] [2024-10-11 12:10:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152180278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 12:10:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337079616] [2024-10-11 12:10:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:10:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:10:36,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:10:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:10:36,326 INFO L87 Difference]: Start difference. First operand 568 states and 826 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:38,871 INFO L93 Difference]: Finished difference Result 1061 states and 1551 transitions. [2024-10-11 12:10:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:10:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 12:10:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:38,878 INFO L225 Difference]: With dead ends: 1061 [2024-10-11 12:10:38,879 INFO L226 Difference]: Without dead ends: 685 [2024-10-11 12:10:38,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2024-10-11 12:10:38,883 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 359 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:38,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1247 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 12:10:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-11 12:10:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 574. [2024-10-11 12:10:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 435 states have (on average 1.360919540229885) internal successors, (592), 439 states have internal predecessors, (592), 122 states have call successors, (122), 16 states have call predecessors, (122), 16 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-11 12:10:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 836 transitions. [2024-10-11 12:10:38,961 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 836 transitions. Word has length 173 [2024-10-11 12:10:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 836 transitions. [2024-10-11 12:10:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 836 transitions. [2024-10-11 12:10:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 12:10:38,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:38,964 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:10:38,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 12:10:38,964 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:38,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 22232569, now seen corresponding path program 1 times [2024-10-11 12:10:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:10:38,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112803150] [2024-10-11 12:10:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:10:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat