./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash bc2e904f13a7fa14a7dbeef3e8e25f99c977216576e94bddd8177d4452d960d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:18:41,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:18:41,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:18:41,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:18:41,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:18:41,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:18:41,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:18:41,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:18:41,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:18:41,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:18:41,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:18:41,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:18:41,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:18:41,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:18:41,228 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:18:41,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:18:41,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:18:41,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:18:41,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:18:41,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:18:41,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:18:41,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:18:41,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:18:41,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:18:41,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:18:41,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:18:41,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:18:41,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:18:41,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:18:41,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:18:41,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:18:41,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:18:41,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:18:41,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:18:41,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:18:41,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:18:41,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:18:41,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:18:41,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:18:41,246 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc2e904f13a7fa14a7dbeef3e8e25f99c977216576e94bddd8177d4452d960d5 [2024-10-11 05:18:41,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:18:41,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:18:41,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:18:41,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:18:41,538 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:18:41,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c [2024-10-11 05:18:42,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:18:43,255 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:18:43,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c [2024-10-11 05:18:43,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71eeb3fe6/3f36ff4a21734b88b0ce1afc019bc90a/FLAG2aacaa811 [2024-10-11 05:18:43,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71eeb3fe6/3f36ff4a21734b88b0ce1afc019bc90a [2024-10-11 05:18:43,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:18:43,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:18:43,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:18:43,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:18:43,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:18:43,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:18:43" (1/1) ... [2024-10-11 05:18:43,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743bf3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:43, skipping insertion in model container [2024-10-11 05:18:43,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:18:43" (1/1) ... [2024-10-11 05:18:43,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:18:43,820 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/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c[1269,1282] [2024-10-11 05:18:44,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:18:44,134 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:18:44,148 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/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c[1269,1282] [2024-10-11 05:18:44,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:18:44,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:18:44,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44 WrapperNode [2024-10-11 05:18:44,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:18:44,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:18:44,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:18:44,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:18:44,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,614 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2623 [2024-10-11 05:18:44,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:18:44,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:18:44,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:18:44,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:18:44,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,868 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 05:18:44,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:44,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:45,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:45,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:45,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:18:45,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:18:45,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:18:45,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:18:45,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (1/1) ... [2024-10-11 05:18:45,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:18:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:18:45,154 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 05:18:45,158 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 05:18:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:18:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 05:18:45,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 05:18:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:18:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:18:45,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:18:45,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:18:45,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:18:48,074 INFO L? ?]: Removed 1452 outVars from TransFormulas that were not future-live. [2024-10-11 05:18:48,074 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:18:48,169 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:18:48,170 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:18:48,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:18:48 BoogieIcfgContainer [2024-10-11 05:18:48,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:18:48,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:18:48,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:18:48,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:18:48,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:18:43" (1/3) ... [2024-10-11 05:18:48,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3373e44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:18:48, skipping insertion in model container [2024-10-11 05:18:48,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:18:44" (2/3) ... [2024-10-11 05:18:48,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3373e44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:18:48, skipping insertion in model container [2024-10-11 05:18:48,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:18:48" (3/3) ... [2024-10-11 05:18:48,180 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c [2024-10-11 05:18:48,197 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:18:48,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:18:48,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:18:48,288 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;@75d11b87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:18:48,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:18:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 773 states, 763 states have (on average 1.4954128440366972) internal successors, (1141), 764 states have internal predecessors, (1141), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 05:18:48,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:48,323 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:48,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:48,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 168863949, now seen corresponding path program 1 times [2024-10-11 05:18:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212996161] [2024-10-11 05:18:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:48,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212996161] [2024-10-11 05:18:48,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212996161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:48,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 05:18:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709182486] [2024-10-11 05:18:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:48,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 05:18:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 05:18:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:18:49,010 INFO L87 Difference]: Start difference. First operand has 773 states, 763 states have (on average 1.4954128440366972) internal successors, (1141), 764 states have internal predecessors, (1141), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:18:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:49,133 INFO L93 Difference]: Finished difference Result 1428 states and 2142 transitions. [2024-10-11 05:18:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 05:18:49,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 262 [2024-10-11 05:18:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:49,154 INFO L225 Difference]: With dead ends: 1428 [2024-10-11 05:18:49,155 INFO L226 Difference]: Without dead ends: 772 [2024-10-11 05:18:49,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 05:18:49,163 INFO L432 NwaCegarLoop]: 1151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:49,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1151 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:18:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-11 05:18:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2024-10-11 05:18:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 763 states have (on average 1.491480996068152) internal successors, (1138), 763 states have internal predecessors, (1138), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1152 transitions. [2024-10-11 05:18:49,259 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1152 transitions. Word has length 262 [2024-10-11 05:18:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:49,261 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1152 transitions. [2024-10-11 05:18:49,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:18:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1152 transitions. [2024-10-11 05:18:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 05:18:49,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:49,273 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:18:49,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash -916269185, now seen corresponding path program 1 times [2024-10-11 05:18:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190817375] [2024-10-11 05:18:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190817375] [2024-10-11 05:18:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190817375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:50,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:50,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:18:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811576767] [2024-10-11 05:18:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:18:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:18:50,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:18:50,847 INFO L87 Difference]: Start difference. First operand 772 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:50,910 INFO L93 Difference]: Finished difference Result 776 states and 1156 transitions. [2024-10-11 05:18:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 262 [2024-10-11 05:18:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:50,918 INFO L225 Difference]: With dead ends: 776 [2024-10-11 05:18:50,918 INFO L226 Difference]: Without dead ends: 774 [2024-10-11 05:18:50,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:18:50,920 INFO L432 NwaCegarLoop]: 1149 mSDtfsCounter, 0 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:50,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3442 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:18:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-11 05:18:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-10-11 05:18:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.4901960784313726) internal successors, (1140), 765 states have internal predecessors, (1140), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1154 transitions. [2024-10-11 05:18:50,945 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1154 transitions. Word has length 262 [2024-10-11 05:18:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:50,947 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1154 transitions. [2024-10-11 05:18:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1154 transitions. [2024-10-11 05:18:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-11 05:18:50,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:50,952 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:50,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:18:50,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1662122908, now seen corresponding path program 1 times [2024-10-11 05:18:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131980261] [2024-10-11 05:18:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131980261] [2024-10-11 05:18:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131980261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:18:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761008321] [2024-10-11 05:18:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:18:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:18:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:18:51,818 INFO L87 Difference]: Start difference. First operand 774 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:52,572 INFO L93 Difference]: Finished difference Result 1966 states and 2934 transitions. [2024-10-11 05:18:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:18:52,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 263 [2024-10-11 05:18:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:52,577 INFO L225 Difference]: With dead ends: 1966 [2024-10-11 05:18:52,577 INFO L226 Difference]: Without dead ends: 774 [2024-10-11 05:18:52,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:18:52,580 INFO L432 NwaCegarLoop]: 1247 mSDtfsCounter, 2208 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:52,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 3354 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:18:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-11 05:18:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-10-11 05:18:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.488888888888889) internal successors, (1139), 765 states have internal predecessors, (1139), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1153 transitions. [2024-10-11 05:18:52,599 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1153 transitions. Word has length 263 [2024-10-11 05:18:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:52,600 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1153 transitions. [2024-10-11 05:18:52,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1153 transitions. [2024-10-11 05:18:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-11 05:18:52,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:52,603 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:52,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:18:52,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:52,605 INFO L85 PathProgramCache]: Analyzing trace with hash -696334112, now seen corresponding path program 1 times [2024-10-11 05:18:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:52,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006374828] [2024-10-11 05:18:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006374828] [2024-10-11 05:18:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006374828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:53,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:53,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:18:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432329317] [2024-10-11 05:18:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:53,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:18:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:53,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:18:53,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:18:53,308 INFO L87 Difference]: Start difference. First operand 774 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:53,931 INFO L93 Difference]: Finished difference Result 1431 states and 2131 transitions. [2024-10-11 05:18:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:53,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 264 [2024-10-11 05:18:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:53,936 INFO L225 Difference]: With dead ends: 1431 [2024-10-11 05:18:53,936 INFO L226 Difference]: Without dead ends: 774 [2024-10-11 05:18:53,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:18:53,938 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 2050 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:53,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 1676 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:18:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-11 05:18:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-10-11 05:18:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.4875816993464053) internal successors, (1138), 765 states have internal predecessors, (1138), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1152 transitions. [2024-10-11 05:18:53,963 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1152 transitions. Word has length 264 [2024-10-11 05:18:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:53,963 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1152 transitions. [2024-10-11 05:18:53,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1152 transitions. [2024-10-11 05:18:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-11 05:18:53,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:53,968 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:53,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:18:53,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:53,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1633145153, now seen corresponding path program 1 times [2024-10-11 05:18:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143301267] [2024-10-11 05:18:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143301267] [2024-10-11 05:18:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143301267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:18:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104530794] [2024-10-11 05:18:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:54,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:18:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:18:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:18:54,663 INFO L87 Difference]: Start difference. First operand 774 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:54,716 INFO L93 Difference]: Finished difference Result 1433 states and 2132 transitions. [2024-10-11 05:18:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 265 [2024-10-11 05:18:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:54,721 INFO L225 Difference]: With dead ends: 1433 [2024-10-11 05:18:54,721 INFO L226 Difference]: Without dead ends: 776 [2024-10-11 05:18:54,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:18:54,723 INFO L432 NwaCegarLoop]: 1147 mSDtfsCounter, 0 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:54,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:18:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-11 05:18:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-11 05:18:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.4863102998696218) internal successors, (1140), 767 states have internal predecessors, (1140), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1154 transitions. [2024-10-11 05:18:54,748 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1154 transitions. Word has length 265 [2024-10-11 05:18:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:54,749 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1154 transitions. [2024-10-11 05:18:54,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1154 transitions. [2024-10-11 05:18:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-11 05:18:54,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:54,752 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:54,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:18:54,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2010072333, now seen corresponding path program 1 times [2024-10-11 05:18:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048353669] [2024-10-11 05:18:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048353669] [2024-10-11 05:18:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048353669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:55,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:55,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:18:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633975756] [2024-10-11 05:18:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:55,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:18:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:18:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:18:55,718 INFO L87 Difference]: Start difference. First operand 776 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:55,874 INFO L93 Difference]: Finished difference Result 1435 states and 2133 transitions. [2024-10-11 05:18:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 266 [2024-10-11 05:18:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:55,879 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 05:18:55,879 INFO L226 Difference]: Without dead ends: 776 [2024-10-11 05:18:55,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 05:18:55,882 INFO L432 NwaCegarLoop]: 1095 mSDtfsCounter, 990 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:55,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 2192 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:18:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-11 05:18:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-11 05:18:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.483702737940026) internal successors, (1138), 767 states have internal predecessors, (1138), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1152 transitions. [2024-10-11 05:18:55,910 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1152 transitions. Word has length 266 [2024-10-11 05:18:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:55,911 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1152 transitions. [2024-10-11 05:18:55,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1152 transitions. [2024-10-11 05:18:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-11 05:18:55,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:55,916 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:18:55,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:55,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1445126934, now seen corresponding path program 1 times [2024-10-11 05:18:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:55,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241634219] [2024-10-11 05:18:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241634219] [2024-10-11 05:18:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241634219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:18:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520319906] [2024-10-11 05:18:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:18:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:18:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:18:56,635 INFO L87 Difference]: Start difference. First operand 776 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:56,797 INFO L93 Difference]: Finished difference Result 1435 states and 2129 transitions. [2024-10-11 05:18:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:56,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 268 [2024-10-11 05:18:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:56,802 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 05:18:56,802 INFO L226 Difference]: Without dead ends: 776 [2024-10-11 05:18:56,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:18:56,804 INFO L432 NwaCegarLoop]: 1095 mSDtfsCounter, 2111 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:56,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 2192 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:18:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-11 05:18:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-11 05:18:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.482398956975228) internal successors, (1137), 767 states have internal predecessors, (1137), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1151 transitions. [2024-10-11 05:18:56,823 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1151 transitions. Word has length 268 [2024-10-11 05:18:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:56,824 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1151 transitions. [2024-10-11 05:18:56,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1151 transitions. [2024-10-11 05:18:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-11 05:18:56,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:56,828 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:56,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:18:56,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 608704506, now seen corresponding path program 1 times [2024-10-11 05:18:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354377015] [2024-10-11 05:18:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:57,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:57,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354377015] [2024-10-11 05:18:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354377015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:57,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:57,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:18:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23136866] [2024-10-11 05:18:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:57,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:18:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:18:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:18:57,516 INFO L87 Difference]: Start difference. First operand 776 states and 1151 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:57,669 INFO L93 Difference]: Finished difference Result 1435 states and 2127 transitions. [2024-10-11 05:18:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:57,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 269 [2024-10-11 05:18:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:57,674 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 05:18:57,674 INFO L226 Difference]: Without dead ends: 776 [2024-10-11 05:18:57,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:18:57,678 INFO L432 NwaCegarLoop]: 1095 mSDtfsCounter, 2033 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:57,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 2192 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:18:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-11 05:18:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-11 05:18:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.4810951760104303) internal successors, (1136), 767 states have internal predecessors, (1136), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1150 transitions. [2024-10-11 05:18:57,703 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1150 transitions. Word has length 269 [2024-10-11 05:18:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:57,704 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1150 transitions. [2024-10-11 05:18:57,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1150 transitions. [2024-10-11 05:18:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-11 05:18:57,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:57,707 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:57,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:18:57,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:57,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -140730010, now seen corresponding path program 1 times [2024-10-11 05:18:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:57,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470837470] [2024-10-11 05:18:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470837470] [2024-10-11 05:18:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470837470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:58,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:18:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190736251] [2024-10-11 05:18:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:58,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:18:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:18:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:18:58,273 INFO L87 Difference]: Start difference. First operand 776 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:58,429 INFO L93 Difference]: Finished difference Result 1435 states and 2125 transitions. [2024-10-11 05:18:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:58,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 270 [2024-10-11 05:18:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:58,433 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 05:18:58,434 INFO L226 Difference]: Without dead ends: 776 [2024-10-11 05:18:58,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:18:58,436 INFO L432 NwaCegarLoop]: 1095 mSDtfsCounter, 1085 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:58,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 2202 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:18:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-11 05:18:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-11 05:18:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.4797913950456323) internal successors, (1135), 767 states have internal predecessors, (1135), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1149 transitions. [2024-10-11 05:18:58,456 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1149 transitions. Word has length 270 [2024-10-11 05:18:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:58,456 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1149 transitions. [2024-10-11 05:18:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1149 transitions. [2024-10-11 05:18:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-11 05:18:58,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:58,460 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:58,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:18:58,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1686913485, now seen corresponding path program 1 times [2024-10-11 05:18:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064106569] [2024-10-11 05:18:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:18:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:18:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:18:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:18:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:18:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:18:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:18:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:18:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:18:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:18:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:18:59,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064106569] [2024-10-11 05:18:59,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064106569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:18:59,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:18:59,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:18:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422933690] [2024-10-11 05:18:59,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:18:59,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:18:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:18:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:18:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:18:59,480 INFO L87 Difference]: Start difference. First operand 776 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:18:59,611 INFO L93 Difference]: Finished difference Result 1435 states and 2123 transitions. [2024-10-11 05:18:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:18:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 271 [2024-10-11 05:18:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:18:59,615 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 05:18:59,616 INFO L226 Difference]: Without dead ends: 776 [2024-10-11 05:18:59,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 05:18:59,618 INFO L432 NwaCegarLoop]: 1095 mSDtfsCounter, 943 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:18:59,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 2192 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:18:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-11 05:18:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-11 05:18:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.4784876140808345) internal successors, (1134), 767 states have internal predecessors, (1134), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 05:18:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1148 transitions. [2024-10-11 05:18:59,638 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1148 transitions. Word has length 271 [2024-10-11 05:18:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:18:59,639 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1148 transitions. [2024-10-11 05:18:59,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:18:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1148 transitions. [2024-10-11 05:18:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-11 05:18:59,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:18:59,643 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:18:59,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:18:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:18:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -362255710, now seen corresponding path program 1 times [2024-10-11 05:18:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:18:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212482281] [2024-10-11 05:18:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:18:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:19:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:19:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:19:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:19:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:19:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 05:19:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 05:19:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:01,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212482281] [2024-10-11 05:19:01,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212482281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:01,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:01,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:19:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905194963] [2024-10-11 05:19:01,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:01,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:19:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:01,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:19:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:01,129 INFO L87 Difference]: Start difference. First operand 776 states and 1148 transitions. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:01,627 INFO L93 Difference]: Finished difference Result 2179 states and 3223 transitions. [2024-10-11 05:19:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:19:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 272 [2024-10-11 05:19:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:01,635 INFO L225 Difference]: With dead ends: 2179 [2024-10-11 05:19:01,635 INFO L226 Difference]: Without dead ends: 1420 [2024-10-11 05:19:01,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:19:01,638 INFO L432 NwaCegarLoop]: 1222 mSDtfsCounter, 1013 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 5649 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:01,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 5649 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:19:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-10-11 05:19:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 835. [2024-10-11 05:19:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 824 states have (on average 1.4769417475728155) internal successors, (1217), 824 states have internal predecessors, (1217), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:19:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1235 transitions. [2024-10-11 05:19:01,667 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1235 transitions. Word has length 272 [2024-10-11 05:19:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:01,668 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1235 transitions. [2024-10-11 05:19:01,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1235 transitions. [2024-10-11 05:19:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-10-11 05:19:01,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:01,672 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:01,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:19:01,672 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:01,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1556960768, now seen corresponding path program 1 times [2024-10-11 05:19:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:01,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638010507] [2024-10-11 05:19:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:19:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:19:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:19:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 05:19:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:19:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 05:19:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 05:19:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:03,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:03,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638010507] [2024-10-11 05:19:03,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638010507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:03,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:03,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200043000] [2024-10-11 05:19:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:03,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:03,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:03,220 INFO L87 Difference]: Start difference. First operand 835 states and 1235 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:03,928 INFO L93 Difference]: Finished difference Result 1498 states and 2214 transitions. [2024-10-11 05:19:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:19:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 273 [2024-10-11 05:19:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:03,933 INFO L225 Difference]: With dead ends: 1498 [2024-10-11 05:19:03,934 INFO L226 Difference]: Without dead ends: 839 [2024-10-11 05:19:03,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 05:19:03,935 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 1071 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:03,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 2522 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:19:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-11 05:19:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2024-10-11 05:19:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 826 states have (on average 1.4757869249394673) internal successors, (1219), 826 states have internal predecessors, (1219), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:19:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1237 transitions. [2024-10-11 05:19:03,958 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1237 transitions. Word has length 273 [2024-10-11 05:19:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:03,958 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1237 transitions. [2024-10-11 05:19:03,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1237 transitions. [2024-10-11 05:19:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-11 05:19:03,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:03,962 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:03,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:19:03,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1401094713, now seen corresponding path program 1 times [2024-10-11 05:19:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900262923] [2024-10-11 05:19:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:19:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:19:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:19:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 05:19:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:19:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 05:19:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 05:19:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900262923] [2024-10-11 05:19:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900262923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:05,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 05:19:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217969824] [2024-10-11 05:19:05,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:05,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 05:19:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 05:19:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:19:05,906 INFO L87 Difference]: Start difference. First operand 837 states and 1237 transitions. Second operand has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:19:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:07,522 INFO L93 Difference]: Finished difference Result 2377 states and 3511 transitions. [2024-10-11 05:19:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:19:07,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 274 [2024-10-11 05:19:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:07,532 INFO L225 Difference]: With dead ends: 2377 [2024-10-11 05:19:07,532 INFO L226 Difference]: Without dead ends: 1716 [2024-10-11 05:19:07,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:19:07,534 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3900 mSDsluCounter, 6490 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3916 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:07,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3916 Valid, 7415 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:19:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-10-11 05:19:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1113. [2024-10-11 05:19:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1091 states have (on average 1.4738771769019248) internal successors, (1608), 1091 states have internal predecessors, (1608), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 05:19:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1648 transitions. [2024-10-11 05:19:07,574 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1648 transitions. Word has length 274 [2024-10-11 05:19:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:07,574 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1648 transitions. [2024-10-11 05:19:07,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:19:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1648 transitions. [2024-10-11 05:19:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-11 05:19:07,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:07,577 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:07,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:19:07,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -579205461, now seen corresponding path program 1 times [2024-10-11 05:19:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:07,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523444232] [2024-10-11 05:19:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:19:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 05:19:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:19:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 05:19:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 05:19:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523444232] [2024-10-11 05:19:08,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523444232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:08,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:19:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571909756] [2024-10-11 05:19:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:08,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:19:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:19:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:08,261 INFO L87 Difference]: Start difference. First operand 1113 states and 1648 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:08,656 INFO L93 Difference]: Finished difference Result 1990 states and 2944 transitions. [2024-10-11 05:19:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:08,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 274 [2024-10-11 05:19:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:08,661 INFO L225 Difference]: With dead ends: 1990 [2024-10-11 05:19:08,661 INFO L226 Difference]: Without dead ends: 1071 [2024-10-11 05:19:08,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:08,663 INFO L432 NwaCegarLoop]: 1266 mSDtfsCounter, 72 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:08,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 3380 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:19:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-11 05:19:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 912. [2024-10-11 05:19:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 898 states have (on average 1.4743875278396437) internal successors, (1324), 898 states have internal predecessors, (1324), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:19:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1348 transitions. [2024-10-11 05:19:08,690 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1348 transitions. Word has length 274 [2024-10-11 05:19:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:08,690 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1348 transitions. [2024-10-11 05:19:08,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1348 transitions. [2024-10-11 05:19:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-11 05:19:08,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:08,693 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:08,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:19:08,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash -213367870, now seen corresponding path program 1 times [2024-10-11 05:19:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462427320] [2024-10-11 05:19:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:19:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:19:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:19:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 05:19:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:19:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 05:19:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 05:19:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462427320] [2024-10-11 05:19:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462427320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:10,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:19:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860040314] [2024-10-11 05:19:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:10,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:19:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:19:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:19:10,564 INFO L87 Difference]: Start difference. First operand 912 states and 1348 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:19:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:11,519 INFO L93 Difference]: Finished difference Result 1598 states and 2359 transitions. [2024-10-11 05:19:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:19:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 275 [2024-10-11 05:19:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:11,524 INFO L225 Difference]: With dead ends: 1598 [2024-10-11 05:19:11,524 INFO L226 Difference]: Without dead ends: 920 [2024-10-11 05:19:11,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:19:11,527 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 1109 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:11,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 3297 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:19:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-11 05:19:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 916. [2024-10-11 05:19:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 902 states have (on average 1.4700665188470066) internal successors, (1326), 902 states have internal predecessors, (1326), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:19:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1350 transitions. [2024-10-11 05:19:11,577 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1350 transitions. Word has length 275 [2024-10-11 05:19:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:11,578 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1350 transitions. [2024-10-11 05:19:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:19:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1350 transitions. [2024-10-11 05:19:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-11 05:19:11,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:11,583 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:11,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:19:11,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:11,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1431111614, now seen corresponding path program 1 times [2024-10-11 05:19:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:11,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249924288] [2024-10-11 05:19:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:19:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:19:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:19:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 05:19:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 05:19:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 05:19:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 05:19:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249924288] [2024-10-11 05:19:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249924288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:12,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:12,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:19:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329430417] [2024-10-11 05:19:12,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:12,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:19:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:19:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:19:12,919 INFO L87 Difference]: Start difference. First operand 916 states and 1350 transitions. Second operand has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:13,373 INFO L93 Difference]: Finished difference Result 1718 states and 2528 transitions. [2024-10-11 05:19:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:19:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 276 [2024-10-11 05:19:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:13,378 INFO L225 Difference]: With dead ends: 1718 [2024-10-11 05:19:13,378 INFO L226 Difference]: Without dead ends: 924 [2024-10-11 05:19:13,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:19:13,380 INFO L432 NwaCegarLoop]: 1114 mSDtfsCounter, 1096 mSDsluCounter, 4174 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 5288 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:13,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 5288 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:19:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-10-11 05:19:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2024-10-11 05:19:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 906 states have (on average 1.465783664459161) internal successors, (1328), 906 states have internal predecessors, (1328), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:19:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1352 transitions. [2024-10-11 05:19:13,404 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1352 transitions. Word has length 276 [2024-10-11 05:19:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:13,404 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1352 transitions. [2024-10-11 05:19:13,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1352 transitions. [2024-10-11 05:19:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-11 05:19:13,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:13,407 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:13,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:19:13,407 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:13,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash 846537631, now seen corresponding path program 1 times [2024-10-11 05:19:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:13,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302541944] [2024-10-11 05:19:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:19:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:19:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:19:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 05:19:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 05:19:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302541944] [2024-10-11 05:19:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302541944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:14,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976448446] [2024-10-11 05:19:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:14,601 INFO L87 Difference]: Start difference. First operand 920 states and 1352 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:14,661 INFO L93 Difference]: Finished difference Result 1755 states and 2574 transitions. [2024-10-11 05:19:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:19:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 277 [2024-10-11 05:19:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:14,666 INFO L225 Difference]: With dead ends: 1755 [2024-10-11 05:19:14,666 INFO L226 Difference]: Without dead ends: 1090 [2024-10-11 05:19:14,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:14,668 INFO L432 NwaCegarLoop]: 1134 mSDtfsCounter, 149 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:14,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 4530 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:19:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-10-11 05:19:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1088. [2024-10-11 05:19:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1074 states have (on average 1.4618249534450651) internal successors, (1570), 1074 states have internal predecessors, (1570), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:19:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1594 transitions. [2024-10-11 05:19:14,694 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1594 transitions. Word has length 277 [2024-10-11 05:19:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:14,694 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1594 transitions. [2024-10-11 05:19:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1594 transitions. [2024-10-11 05:19:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-11 05:19:14,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:14,697 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:19:14,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1381751004, now seen corresponding path program 1 times [2024-10-11 05:19:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358410265] [2024-10-11 05:19:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:19:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:19:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:19:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 05:19:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 05:19:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358410265] [2024-10-11 05:19:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358410265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 05:19:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475845540] [2024-10-11 05:19:16,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 05:19:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 05:19:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:19:16,342 INFO L87 Difference]: Start difference. First operand 1088 states and 1594 transitions. Second operand has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:17,700 INFO L93 Difference]: Finished difference Result 2957 states and 4324 transitions. [2024-10-11 05:19:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:19:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 278 [2024-10-11 05:19:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:17,709 INFO L225 Difference]: With dead ends: 2957 [2024-10-11 05:19:17,709 INFO L226 Difference]: Without dead ends: 2124 [2024-10-11 05:19:17,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:19:17,712 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 3678 mSDsluCounter, 6304 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3688 SdHoareTripleChecker+Valid, 7212 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:17,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3688 Valid, 7212 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:19:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-10-11 05:19:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1367. [2024-10-11 05:19:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1342 states have (on average 1.4567809239940388) internal successors, (1955), 1342 states have internal predecessors, (1955), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:19:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2001 transitions. [2024-10-11 05:19:17,752 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2001 transitions. Word has length 278 [2024-10-11 05:19:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:17,753 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2001 transitions. [2024-10-11 05:19:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2001 transitions. [2024-10-11 05:19:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-11 05:19:17,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:17,757 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:17,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:19:17,757 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:17,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1036907884, now seen corresponding path program 1 times [2024-10-11 05:19:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756911458] [2024-10-11 05:19:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:19:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:19:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:19:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 05:19:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 05:19:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756911458] [2024-10-11 05:19:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756911458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:19:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684874616] [2024-10-11 05:19:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:19,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:19:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:19:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:19:19,306 INFO L87 Difference]: Start difference. First operand 1367 states and 2001 transitions. Second operand has 8 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:19,558 INFO L93 Difference]: Finished difference Result 2903 states and 4247 transitions. [2024-10-11 05:19:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:19:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 279 [2024-10-11 05:19:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:19,566 INFO L225 Difference]: With dead ends: 2903 [2024-10-11 05:19:19,567 INFO L226 Difference]: Without dead ends: 2054 [2024-10-11 05:19:19,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:19:19,569 INFO L432 NwaCegarLoop]: 1114 mSDtfsCounter, 2775 mSDsluCounter, 5531 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2784 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:19,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2784 Valid, 6645 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:19:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-10-11 05:19:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1369. [2024-10-11 05:19:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1344 states have (on average 1.4546130952380953) internal successors, (1955), 1344 states have internal predecessors, (1955), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:19:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2001 transitions. [2024-10-11 05:19:19,605 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2001 transitions. Word has length 279 [2024-10-11 05:19:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:19,605 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2001 transitions. [2024-10-11 05:19:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2001 transitions. [2024-10-11 05:19:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-11 05:19:19,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:19,608 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:19:19,609 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 496820035, now seen corresponding path program 1 times [2024-10-11 05:19:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832080390] [2024-10-11 05:19:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:19:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:19:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 05:19:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:19:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 05:19:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 05:19:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 05:19:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:20,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832080390] [2024-10-11 05:19:20,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832080390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:20,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:20,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408229949] [2024-10-11 05:19:20,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:20,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:20,829 INFO L87 Difference]: Start difference. First operand 1369 states and 2001 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:21,460 INFO L93 Difference]: Finished difference Result 2206 states and 3225 transitions. [2024-10-11 05:19:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:19:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 279 [2024-10-11 05:19:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:21,465 INFO L225 Difference]: With dead ends: 2206 [2024-10-11 05:19:21,466 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 05:19:21,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 05:19:21,468 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 984 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:21,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2496 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:19:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 05:19:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1371. [2024-10-11 05:19:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1346 states have (on average 1.4539375928677563) internal successors, (1957), 1346 states have internal predecessors, (1957), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:19:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2003 transitions. [2024-10-11 05:19:21,509 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2003 transitions. Word has length 279 [2024-10-11 05:19:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:21,509 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2003 transitions. [2024-10-11 05:19:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2003 transitions. [2024-10-11 05:19:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-11 05:19:21,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:21,514 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:19:21,514 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1128409508, now seen corresponding path program 1 times [2024-10-11 05:19:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:21,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196757236] [2024-10-11 05:19:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:19:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:19:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 05:19:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:19:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 05:19:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 05:19:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 05:19:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196757236] [2024-10-11 05:19:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196757236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:22,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:19:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306873594] [2024-10-11 05:19:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:19:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:22,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:19:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:19:22,810 INFO L87 Difference]: Start difference. First operand 1371 states and 2003 transitions. Second operand has 8 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:19:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:23,062 INFO L93 Difference]: Finished difference Result 3177 states and 4640 transitions. [2024-10-11 05:19:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:19:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 279 [2024-10-11 05:19:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:23,071 INFO L225 Difference]: With dead ends: 3177 [2024-10-11 05:19:23,071 INFO L226 Difference]: Without dead ends: 2318 [2024-10-11 05:19:23,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:19:23,075 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 2645 mSDsluCounter, 5528 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 6652 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:23,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 6652 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:19:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-10-11 05:19:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1579. [2024-10-11 05:19:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1542 states have (on average 1.4481193255512321) internal successors, (2233), 1542 states have internal predecessors, (2233), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2303 transitions. [2024-10-11 05:19:23,118 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2303 transitions. Word has length 279 [2024-10-11 05:19:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:23,119 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2303 transitions. [2024-10-11 05:19:23,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:19:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2303 transitions. [2024-10-11 05:19:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-11 05:19:23,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:23,123 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:23,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:19:23,123 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:23,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash 383315571, now seen corresponding path program 1 times [2024-10-11 05:19:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:23,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597270234] [2024-10-11 05:19:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:19:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:19:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:19:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 05:19:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 05:19:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597270234] [2024-10-11 05:19:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597270234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:19:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545918012] [2024-10-11 05:19:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:19:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:19:23,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:23,907 INFO L87 Difference]: Start difference. First operand 1579 states and 2303 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:24,407 INFO L93 Difference]: Finished difference Result 2467 states and 3599 transitions. [2024-10-11 05:19:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:24,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 280 [2024-10-11 05:19:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:24,414 INFO L225 Difference]: With dead ends: 2467 [2024-10-11 05:19:24,414 INFO L226 Difference]: Without dead ends: 1579 [2024-10-11 05:19:24,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:24,417 INFO L432 NwaCegarLoop]: 843 mSDtfsCounter, 1046 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:24,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1675 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:19:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-10-11 05:19:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2024-10-11 05:19:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1542 states have (on average 1.446822308690013) internal successors, (2231), 1542 states have internal predecessors, (2231), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2301 transitions. [2024-10-11 05:19:24,460 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2301 transitions. Word has length 280 [2024-10-11 05:19:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:24,460 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2301 transitions. [2024-10-11 05:19:24,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2301 transitions. [2024-10-11 05:19:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-11 05:19:24,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:24,465 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:24,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:19:24,466 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:24,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1003476456, now seen corresponding path program 1 times [2024-10-11 05:19:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062551185] [2024-10-11 05:19:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:19:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:19:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:19:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 05:19:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 05:19:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:26,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:26,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062551185] [2024-10-11 05:19:26,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062551185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:26,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:26,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:19:26,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643128865] [2024-10-11 05:19:26,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:26,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:19:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:26,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:19:26,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:19:26,088 INFO L87 Difference]: Start difference. First operand 1579 states and 2301 transitions. Second operand has 8 states, 8 states have (on average 31.125) internal successors, (249), 8 states have internal predecessors, (249), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:26,343 INFO L93 Difference]: Finished difference Result 3140 states and 4577 transitions. [2024-10-11 05:19:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:19:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.125) internal successors, (249), 8 states have internal predecessors, (249), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 281 [2024-10-11 05:19:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:26,353 INFO L225 Difference]: With dead ends: 3140 [2024-10-11 05:19:26,356 INFO L226 Difference]: Without dead ends: 2250 [2024-10-11 05:19:26,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:19:26,361 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 1930 mSDsluCounter, 5546 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 6659 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:26,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 6659 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:19:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2024-10-11 05:19:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1577. [2024-10-11 05:19:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1540 states have (on average 1.4461038961038961) internal successors, (2227), 1540 states have internal predecessors, (2227), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2297 transitions. [2024-10-11 05:19:26,401 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2297 transitions. Word has length 281 [2024-10-11 05:19:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:26,401 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2297 transitions. [2024-10-11 05:19:26,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.125) internal successors, (249), 8 states have internal predecessors, (249), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2297 transitions. [2024-10-11 05:19:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-11 05:19:26,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:26,406 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:26,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:19:26,406 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:26,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1840225623, now seen corresponding path program 1 times [2024-10-11 05:19:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288993608] [2024-10-11 05:19:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:19:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:19:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 05:19:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:19:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 05:19:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 05:19:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 05:19:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:27,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288993608] [2024-10-11 05:19:27,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288993608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:27,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:27,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:19:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540897564] [2024-10-11 05:19:27,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:19:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:19:27,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:19:27,434 INFO L87 Difference]: Start difference. First operand 1577 states and 2297 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:28,124 INFO L93 Difference]: Finished difference Result 2469 states and 3597 transitions. [2024-10-11 05:19:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:19:28,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 281 [2024-10-11 05:19:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:28,129 INFO L225 Difference]: With dead ends: 2469 [2024-10-11 05:19:28,129 INFO L226 Difference]: Without dead ends: 1581 [2024-10-11 05:19:28,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:19:28,131 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1071 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 3291 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:28,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 3291 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:19:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-11 05:19:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1578. [2024-10-11 05:19:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1541 states have (on average 1.4451654769630111) internal successors, (2227), 1541 states have internal predecessors, (2227), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2297 transitions. [2024-10-11 05:19:28,164 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2297 transitions. Word has length 281 [2024-10-11 05:19:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:28,165 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2297 transitions. [2024-10-11 05:19:28,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2297 transitions. [2024-10-11 05:19:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-11 05:19:28,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:28,168 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:28,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:19:28,169 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:28,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1063949607, now seen corresponding path program 1 times [2024-10-11 05:19:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788713479] [2024-10-11 05:19:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:19:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:19:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:19:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 05:19:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 05:19:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788713479] [2024-10-11 05:19:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788713479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:19:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006372797] [2024-10-11 05:19:29,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:19:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:19:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:19:29,251 INFO L87 Difference]: Start difference. First operand 1578 states and 2297 transitions. Second operand has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:29,398 INFO L93 Difference]: Finished difference Result 2661 states and 3867 transitions. [2024-10-11 05:19:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:19:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 282 [2024-10-11 05:19:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:29,404 INFO L225 Difference]: With dead ends: 2661 [2024-10-11 05:19:29,404 INFO L226 Difference]: Without dead ends: 1594 [2024-10-11 05:19:29,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:19:29,407 INFO L432 NwaCegarLoop]: 1115 mSDtfsCounter, 1045 mSDsluCounter, 4441 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 5556 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:29,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 5556 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:19:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-11 05:19:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1586. [2024-10-11 05:19:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1549 states have (on average 1.4402840542285344) internal successors, (2231), 1549 states have internal predecessors, (2231), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2301 transitions. [2024-10-11 05:19:29,454 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2301 transitions. Word has length 282 [2024-10-11 05:19:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2301 transitions. [2024-10-11 05:19:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2301 transitions. [2024-10-11 05:19:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-11 05:19:29,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:29,458 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:29,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:19:29,458 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1153196902, now seen corresponding path program 1 times [2024-10-11 05:19:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:29,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105001161] [2024-10-11 05:19:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:19:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:19:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 05:19:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 05:19:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105001161] [2024-10-11 05:19:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105001161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892625075] [2024-10-11 05:19:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:29,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:29,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:29,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:29,900 INFO L87 Difference]: Start difference. First operand 1586 states and 2301 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:30,478 INFO L93 Difference]: Finished difference Result 2679 states and 3888 transitions. [2024-10-11 05:19:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:19:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 282 [2024-10-11 05:19:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:30,481 INFO L225 Difference]: With dead ends: 2679 [2024-10-11 05:19:30,481 INFO L226 Difference]: Without dead ends: 1594 [2024-10-11 05:19:30,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 05:19:30,483 INFO L432 NwaCegarLoop]: 841 mSDtfsCounter, 1105 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:30,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2500 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:19:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-11 05:19:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2024-10-11 05:19:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1557 states have (on average 1.4380218368657676) internal successors, (2239), 1557 states have internal predecessors, (2239), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2309 transitions. [2024-10-11 05:19:30,516 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2309 transitions. Word has length 282 [2024-10-11 05:19:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:30,516 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 2309 transitions. [2024-10-11 05:19:30,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2309 transitions. [2024-10-11 05:19:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-11 05:19:30,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:30,520 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:30,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:19:30,520 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1786164281, now seen corresponding path program 1 times [2024-10-11 05:19:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696965317] [2024-10-11 05:19:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 05:19:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:19:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 05:19:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 05:19:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 05:19:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:30,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:30,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696965317] [2024-10-11 05:19:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696965317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:19:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712439144] [2024-10-11 05:19:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:30,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:19:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:19:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:30,916 INFO L87 Difference]: Start difference. First operand 1594 states and 2309 transitions. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:31,572 INFO L93 Difference]: Finished difference Result 2790 states and 4041 transitions. [2024-10-11 05:19:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:19:31,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 283 [2024-10-11 05:19:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:31,575 INFO L225 Difference]: With dead ends: 2790 [2024-10-11 05:19:31,575 INFO L226 Difference]: Without dead ends: 1626 [2024-10-11 05:19:31,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:31,577 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 1102 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:31,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 3318 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:19:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-11 05:19:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1610. [2024-10-11 05:19:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1573 states have (on average 1.4335664335664335) internal successors, (2255), 1573 states have internal predecessors, (2255), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:19:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2325 transitions. [2024-10-11 05:19:31,610 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2325 transitions. Word has length 283 [2024-10-11 05:19:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:31,611 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2325 transitions. [2024-10-11 05:19:31,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2325 transitions. [2024-10-11 05:19:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-11 05:19:31,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:31,615 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:31,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:19:31,615 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:31,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1150492649, now seen corresponding path program 1 times [2024-10-11 05:19:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879820858] [2024-10-11 05:19:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:19:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:19:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 05:19:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 05:19:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:19:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 05:19:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 05:19:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879820858] [2024-10-11 05:19:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879820858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:19:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709028045] [2024-10-11 05:19:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:19:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:19:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:32,153 INFO L87 Difference]: Start difference. First operand 1610 states and 2325 transitions. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:33,215 INFO L93 Difference]: Finished difference Result 3454 states and 5001 transitions. [2024-10-11 05:19:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:19:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 283 [2024-10-11 05:19:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:33,219 INFO L225 Difference]: With dead ends: 3454 [2024-10-11 05:19:33,219 INFO L226 Difference]: Without dead ends: 2556 [2024-10-11 05:19:33,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:19:33,221 INFO L432 NwaCegarLoop]: 1379 mSDtfsCounter, 1939 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 4939 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:33,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 4939 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:19:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-10-11 05:19:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1901. [2024-10-11 05:19:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1849 states have (on average 1.4288804759329368) internal successors, (2642), 1849 states have internal predecessors, (2642), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 05:19:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2742 transitions. [2024-10-11 05:19:33,268 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2742 transitions. Word has length 283 [2024-10-11 05:19:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:33,270 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2742 transitions. [2024-10-11 05:19:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2742 transitions. [2024-10-11 05:19:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-10-11 05:19:33,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:33,277 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:33,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:19:33,277 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:33,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1045814496, now seen corresponding path program 1 times [2024-10-11 05:19:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:33,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695477241] [2024-10-11 05:19:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695477241] [2024-10-11 05:19:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695477241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:33,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:19:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287193138] [2024-10-11 05:19:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:19:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:19:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:33,972 INFO L87 Difference]: Start difference. First operand 1901 states and 2742 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:34,444 INFO L93 Difference]: Finished difference Result 2897 states and 4185 transitions. [2024-10-11 05:19:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:34,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 284 [2024-10-11 05:19:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:34,449 INFO L225 Difference]: With dead ends: 2897 [2024-10-11 05:19:34,449 INFO L226 Difference]: Without dead ends: 1901 [2024-10-11 05:19:34,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:34,451 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 998 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:34,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1673 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:19:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-11 05:19:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1901. [2024-10-11 05:19:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1849 states have (on average 1.4277988101676582) internal successors, (2640), 1849 states have internal predecessors, (2640), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 05:19:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2740 transitions. [2024-10-11 05:19:34,489 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2740 transitions. Word has length 284 [2024-10-11 05:19:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2740 transitions. [2024-10-11 05:19:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2740 transitions. [2024-10-11 05:19:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-11 05:19:34,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:34,494 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:34,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 05:19:34,495 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:34,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash -689422274, now seen corresponding path program 1 times [2024-10-11 05:19:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:34,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38364642] [2024-10-11 05:19:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38364642] [2024-10-11 05:19:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38364642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:35,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:35,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:19:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166336932] [2024-10-11 05:19:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:35,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:19:35,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:19:35,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:19:35,024 INFO L87 Difference]: Start difference. First operand 1901 states and 2740 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:35,098 INFO L93 Difference]: Finished difference Result 3330 states and 4804 transitions. [2024-10-11 05:19:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:35,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 285 [2024-10-11 05:19:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:35,101 INFO L225 Difference]: With dead ends: 3330 [2024-10-11 05:19:35,101 INFO L226 Difference]: Without dead ends: 1877 [2024-10-11 05:19:35,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 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 05:19:35,103 INFO L432 NwaCegarLoop]: 1118 mSDtfsCounter, 1032 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:35,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 2245 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:19:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-11 05:19:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2024-10-11 05:19:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1825 states have (on average 1.426849315068493) internal successors, (2604), 1825 states have internal predecessors, (2604), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 05:19:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2704 transitions. [2024-10-11 05:19:35,141 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2704 transitions. Word has length 285 [2024-10-11 05:19:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:35,142 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2704 transitions. [2024-10-11 05:19:35,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:19:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2704 transitions. [2024-10-11 05:19:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-11 05:19:35,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:35,145 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:35,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:19:35,146 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:35,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash 800557786, now seen corresponding path program 1 times [2024-10-11 05:19:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152174187] [2024-10-11 05:19:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 05:19:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152174187] [2024-10-11 05:19:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152174187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:19:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814308818] [2024-10-11 05:19:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:19:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:19:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:36,294 INFO L87 Difference]: Start difference. First operand 1877 states and 2704 transitions. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:36,475 INFO L93 Difference]: Finished difference Result 3522 states and 5073 transitions. [2024-10-11 05:19:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:19:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 285 [2024-10-11 05:19:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:36,481 INFO L225 Difference]: With dead ends: 3522 [2024-10-11 05:19:36,481 INFO L226 Difference]: Without dead ends: 2532 [2024-10-11 05:19:36,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:19:36,484 INFO L432 NwaCegarLoop]: 1116 mSDtfsCounter, 2074 mSDsluCounter, 3344 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:36,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 4460 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:19:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-11 05:19:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-11 05:19:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.4239350912778905) internal successors, (3510), 2465 states have internal predecessors, (3510), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 05:19:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3640 transitions. [2024-10-11 05:19:36,538 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3640 transitions. Word has length 285 [2024-10-11 05:19:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:36,539 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3640 transitions. [2024-10-11 05:19:36,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:19:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3640 transitions. [2024-10-11 05:19:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2024-10-11 05:19:36,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:36,592 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:36,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:19:36,593 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -267985809, now seen corresponding path program 1 times [2024-10-11 05:19:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:36,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983472194] [2024-10-11 05:19:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:36,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2024-10-11 05:19:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-10-11 05:19:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2024-10-11 05:19:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2024-10-11 05:19:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 515 [2024-10-11 05:19:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-10-11 05:19:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2024-10-11 05:19:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 05:19:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983472194] [2024-10-11 05:19:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983472194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587027420] [2024-10-11 05:19:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:37,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:37,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:37,850 INFO L87 Difference]: Start difference. First operand 2532 states and 3640 transitions. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:38,006 INFO L93 Difference]: Finished difference Result 3522 states and 5072 transitions. [2024-10-11 05:19:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 665 [2024-10-11 05:19:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:38,013 INFO L225 Difference]: With dead ends: 3522 [2024-10-11 05:19:38,013 INFO L226 Difference]: Without dead ends: 2532 [2024-10-11 05:19:38,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:38,016 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 998 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:38,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 2188 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:19:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-11 05:19:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-11 05:19:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.423529411764706) internal successors, (3509), 2465 states have internal predecessors, (3509), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 05:19:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3639 transitions. [2024-10-11 05:19:38,073 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3639 transitions. Word has length 665 [2024-10-11 05:19:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:38,074 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3639 transitions. [2024-10-11 05:19:38,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3639 transitions. [2024-10-11 05:19:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2024-10-11 05:19:38,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:38,082 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:38,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 05:19:38,082 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:38,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1965256542, now seen corresponding path program 1 times [2024-10-11 05:19:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86615296] [2024-10-11 05:19:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 454 [2024-10-11 05:19:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 468 [2024-10-11 05:19:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-10-11 05:19:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 505 [2024-10-11 05:19:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516 [2024-10-11 05:19:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 529 [2024-10-11 05:19:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2024-10-11 05:19:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 05:19:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86615296] [2024-10-11 05:19:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86615296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:39,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940670737] [2024-10-11 05:19:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:39,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:39,334 INFO L87 Difference]: Start difference. First operand 2532 states and 3639 transitions. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:39,457 INFO L93 Difference]: Finished difference Result 3522 states and 5070 transitions. [2024-10-11 05:19:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 666 [2024-10-11 05:19:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:39,464 INFO L225 Difference]: With dead ends: 3522 [2024-10-11 05:19:39,464 INFO L226 Difference]: Without dead ends: 2532 [2024-10-11 05:19:39,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:39,467 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 1824 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:39,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 2178 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:19:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-11 05:19:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-11 05:19:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.4231237322515213) internal successors, (3508), 2465 states have internal predecessors, (3508), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 05:19:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3638 transitions. [2024-10-11 05:19:39,520 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3638 transitions. Word has length 666 [2024-10-11 05:19:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:39,521 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3638 transitions. [2024-10-11 05:19:39,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3638 transitions. [2024-10-11 05:19:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2024-10-11 05:19:39,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:39,529 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:39,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 05:19:39,529 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash -287194822, now seen corresponding path program 1 times [2024-10-11 05:19:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:39,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171497706] [2024-10-11 05:19:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2024-10-11 05:19:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2024-10-11 05:19:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-10-11 05:19:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2024-10-11 05:19:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2024-10-11 05:19:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-10-11 05:19:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2024-10-11 05:19:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 05:19:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171497706] [2024-10-11 05:19:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171497706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994486375] [2024-10-11 05:19:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:40,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:40,799 INFO L87 Difference]: Start difference. First operand 2532 states and 3638 transitions. Second operand has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:41,230 INFO L93 Difference]: Finished difference Result 3522 states and 5068 transitions. [2024-10-11 05:19:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:41,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 667 [2024-10-11 05:19:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:41,236 INFO L225 Difference]: With dead ends: 3522 [2024-10-11 05:19:41,237 INFO L226 Difference]: Without dead ends: 2532 [2024-10-11 05:19:41,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:41,239 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 895 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:41,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1662 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:19:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-11 05:19:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-11 05:19:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.4227180527383367) internal successors, (3507), 2465 states have internal predecessors, (3507), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 05:19:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3637 transitions. [2024-10-11 05:19:41,290 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3637 transitions. Word has length 667 [2024-10-11 05:19:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:41,291 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3637 transitions. [2024-10-11 05:19:41,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3637 transitions. [2024-10-11 05:19:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2024-10-11 05:19:41,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:41,299 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:41,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 05:19:41,299 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:41,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1355514359, now seen corresponding path program 1 times [2024-10-11 05:19:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078183167] [2024-10-11 05:19:41,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:19:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:19:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:19:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:19:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 05:19:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 05:19:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 05:19:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 05:19:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-10-11 05:19:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2024-10-11 05:19:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2024-10-11 05:19:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2024-10-11 05:19:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2024-10-11 05:19:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 531 [2024-10-11 05:19:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 544 [2024-10-11 05:19:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:19:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 05:19:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:19:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078183167] [2024-10-11 05:19:42,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078183167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:19:42,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:19:42,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:19:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131606940] [2024-10-11 05:19:42,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:19:42,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:19:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:19:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:19:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:19:42,540 INFO L87 Difference]: Start difference. First operand 2532 states and 3637 transitions. Second operand has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:19:42,652 INFO L93 Difference]: Finished difference Result 3522 states and 5066 transitions. [2024-10-11 05:19:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:19:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 668 [2024-10-11 05:19:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:19:42,659 INFO L225 Difference]: With dead ends: 3522 [2024-10-11 05:19:42,660 INFO L226 Difference]: Without dead ends: 2532 [2024-10-11 05:19:42,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:19:42,662 INFO L432 NwaCegarLoop]: 1087 mSDtfsCounter, 1724 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:19:42,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 2176 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:19:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-11 05:19:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-11 05:19:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.4223123732251521) internal successors, (3506), 2465 states have internal predecessors, (3506), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 05:19:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3636 transitions. [2024-10-11 05:19:42,709 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3636 transitions. Word has length 668 [2024-10-11 05:19:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:19:42,709 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3636 transitions. [2024-10-11 05:19:42,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:19:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3636 transitions. [2024-10-11 05:19:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2024-10-11 05:19:42,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:19:42,717 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:42,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 05:19:42,717 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:19:42,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:19:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1483433202, now seen corresponding path program 1 times [2024-10-11 05:19:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:19:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437584233] [2024-10-11 05:19:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:19:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms