./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bc2e904f13a7fa14a7dbeef3e8e25f99c977216576e94bddd8177d4452d960d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:59:06,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:59:06,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 21:59:06,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:59:06,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:59:06,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:59:06,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:59:06,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:59:06,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:59:06,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:59:06,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:59:06,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:59:06,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:59:06,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:59:06,185 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:59:06,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:59:06,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:59:06,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:59:06,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:59:06,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:59:06,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:59:06,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:59:06,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:59:06,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:59:06,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:59:06,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:59:06,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:59:06,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:59:06,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:59:06,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:59:06,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:59:06,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:59:06,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:59:06,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:59:06,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:59:06,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:59:06,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:59:06,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:59:06,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:59:06,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc2e904f13a7fa14a7dbeef3e8e25f99c977216576e94bddd8177d4452d960d5 [2024-10-12 21:59:06,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:59:06,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:59:06,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:59:06,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:59:06,456 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:59:06,457 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-12 21:59:07,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:59:08,130 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:59:08,131 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-12 21:59:08,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453c79690/a9b0df3afa2b475396193ef3b4ef9fa0/FLAG640fb3db5 [2024-10-12 21:59:08,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453c79690/a9b0df3afa2b475396193ef3b4ef9fa0 [2024-10-12 21:59:08,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:59:08,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:59:08,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:59:08,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:59:08,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:59:08,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:59:08" (1/1) ... [2024-10-12 21:59:08,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4cc259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:08, skipping insertion in model container [2024-10-12 21:59:08,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:59:08" (1/1) ... [2024-10-12 21:59:08,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:59:08,625 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-12 21:59:08,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:59:08,938 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:59:08,946 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-12 21:59:09,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:59:09,021 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:59:09,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09 WrapperNode [2024-10-12 21:59:09,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:59:09,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:59:09,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:59:09,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:59:09,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,245 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2623 [2024-10-12 21:59:09,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:59:09,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:59:09,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:59:09,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:59:09,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,598 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-12 21:59:09,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:59:09,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:59:09,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:59:09,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:59:09,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (1/1) ... [2024-10-12 21:59:09,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:59:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:59:09,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:59:09,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:59:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:59:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 21:59:09,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 21:59:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:59:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:59:09,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:59:10,080 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:59:10,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:59:12,044 INFO L? ?]: Removed 1452 outVars from TransFormulas that were not future-live. [2024-10-12 21:59:12,044 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:59:12,107 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:59:12,107 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 21:59:12,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:59:12 BoogieIcfgContainer [2024-10-12 21:59:12,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:59:12,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:59:12,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:59:12,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:59:12,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:59:08" (1/3) ... [2024-10-12 21:59:12,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02e716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:59:12, skipping insertion in model container [2024-10-12 21:59:12,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:59:09" (2/3) ... [2024-10-12 21:59:12,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02e716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:59:12, skipping insertion in model container [2024-10-12 21:59:12,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:59:12" (3/3) ... [2024-10-12 21:59:12,118 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c [2024-10-12 21:59:12,131 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:59:12,132 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 21:59:12,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:59:12,211 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;@2861c77c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:59:12,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 21:59:12,218 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-12 21:59:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-12 21:59:12,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:12,240 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-12 21:59:12,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash 168863949, now seen corresponding path program 1 times [2024-10-12 21:59:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509061931] [2024-10-12 21:59:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:12,774 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-12 21:59:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509061931] [2024-10-12 21:59:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509061931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:12,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:59:12,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896575725] [2024-10-12 21:59:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:12,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:59:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:12,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:59:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:59:12,815 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-12 21:59:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:12,881 INFO L93 Difference]: Finished difference Result 1428 states and 2142 transitions. [2024-10-12 21:59:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:59:12,888 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-12 21:59:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:12,907 INFO L225 Difference]: With dead ends: 1428 [2024-10-12 21:59:12,907 INFO L226 Difference]: Without dead ends: 772 [2024-10-12 21:59:12,912 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-12 21:59:12,918 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-12 21:59:12,919 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-12 21:59:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-12 21:59:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2024-10-12 21:59:12,993 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-12 21:59:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1152 transitions. [2024-10-12 21:59:12,999 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1152 transitions. Word has length 262 [2024-10-12 21:59:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1152 transitions. [2024-10-12 21:59:13,001 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-12 21:59:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1152 transitions. [2024-10-12 21:59:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-12 21:59:13,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:13,010 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-12 21:59:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:59:13,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:13,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash -916269185, now seen corresponding path program 1 times [2024-10-12 21:59:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:13,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552035886] [2024-10-12 21:59:13,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,066 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-12 21:59:14,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552035886] [2024-10-12 21:59:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552035886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770421916] [2024-10-12 21:59:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:14,072 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-12 21:59:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:14,117 INFO L93 Difference]: Finished difference Result 776 states and 1156 transitions. [2024-10-12 21:59:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:14,117 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-12 21:59:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:14,122 INFO L225 Difference]: With dead ends: 776 [2024-10-12 21:59:14,122 INFO L226 Difference]: Without dead ends: 774 [2024-10-12 21:59:14,123 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-12 21:59:14,125 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-12 21:59:14,125 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-12 21:59:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-12 21:59:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-10-12 21:59:14,141 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-12 21:59:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1154 transitions. [2024-10-12 21:59:14,143 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1154 transitions. Word has length 262 [2024-10-12 21:59:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:14,145 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1154 transitions. [2024-10-12 21:59:14,145 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-12 21:59:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1154 transitions. [2024-10-12 21:59:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-12 21:59:14,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:14,149 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-12 21:59:14,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:59:14,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:14,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1662122908, now seen corresponding path program 1 times [2024-10-12 21:59:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:14,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424005275] [2024-10-12 21:59:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:14,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:14,712 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-12 21:59:14,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424005275] [2024-10-12 21:59:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424005275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:14,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148718822] [2024-10-12 21:59:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:14,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:14,718 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-12 21:59:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:15,251 INFO L93 Difference]: Finished difference Result 1966 states and 2934 transitions. [2024-10-12 21:59:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:15,252 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-12 21:59:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:15,255 INFO L225 Difference]: With dead ends: 1966 [2024-10-12 21:59:15,255 INFO L226 Difference]: Without dead ends: 774 [2024-10-12 21:59:15,257 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-12 21:59:15,258 INFO L432 NwaCegarLoop]: 1247 mSDtfsCounter, 2208 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:15,260 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.5s Time] [2024-10-12 21:59:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-12 21:59:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-10-12 21:59:15,269 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-12 21:59:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1153 transitions. [2024-10-12 21:59:15,272 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1153 transitions. Word has length 263 [2024-10-12 21:59:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:15,272 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1153 transitions. [2024-10-12 21:59:15,272 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-12 21:59:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1153 transitions. [2024-10-12 21:59:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-12 21:59:15,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:15,274 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-12 21:59:15,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:59:15,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -696334112, now seen corresponding path program 1 times [2024-10-12 21:59:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:15,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903341182] [2024-10-12 21:59:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:15,761 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-12 21:59:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903341182] [2024-10-12 21:59:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903341182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921431948] [2024-10-12 21:59:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:15,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:15,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:15,764 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-12 21:59:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:16,186 INFO L93 Difference]: Finished difference Result 1431 states and 2131 transitions. [2024-10-12 21:59:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:16,187 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-12 21:59:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:16,191 INFO L225 Difference]: With dead ends: 1431 [2024-10-12 21:59:16,191 INFO L226 Difference]: Without dead ends: 774 [2024-10-12 21:59:16,191 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-12 21:59:16,192 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 2050 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:16,192 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.4s Time] [2024-10-12 21:59:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-12 21:59:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-10-12 21:59:16,204 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-12 21:59:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1152 transitions. [2024-10-12 21:59:16,206 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1152 transitions. Word has length 264 [2024-10-12 21:59:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:16,207 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1152 transitions. [2024-10-12 21:59:16,207 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-12 21:59:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1152 transitions. [2024-10-12 21:59:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-12 21:59:16,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:16,210 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-12 21:59:16,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:59:16,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:16,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1633145153, now seen corresponding path program 1 times [2024-10-12 21:59:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440668390] [2024-10-12 21:59:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:16,773 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-12 21:59:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440668390] [2024-10-12 21:59:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440668390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:16,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052643155] [2024-10-12 21:59:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:16,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:16,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:16,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:16,776 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-12 21:59:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:16,835 INFO L93 Difference]: Finished difference Result 1433 states and 2132 transitions. [2024-10-12 21:59:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:16,836 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-12 21:59:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:16,839 INFO L225 Difference]: With dead ends: 1433 [2024-10-12 21:59:16,839 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 21:59:16,840 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-12 21:59:16,841 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-12 21:59:16,841 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-12 21:59:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 21:59:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-12 21:59:16,852 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-12 21:59:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1154 transitions. [2024-10-12 21:59:16,854 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1154 transitions. Word has length 265 [2024-10-12 21:59:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1154 transitions. [2024-10-12 21:59:16,855 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-12 21:59:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1154 transitions. [2024-10-12 21:59:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-12 21:59:16,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:16,858 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-12 21:59:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:59:16,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2010072333, now seen corresponding path program 1 times [2024-10-12 21:59:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378990674] [2024-10-12 21:59:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:17,595 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-12 21:59:17,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378990674] [2024-10-12 21:59:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378990674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:17,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022683329] [2024-10-12 21:59:17,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:17,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:17,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:17,597 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-12 21:59:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:17,696 INFO L93 Difference]: Finished difference Result 1435 states and 2133 transitions. [2024-10-12 21:59:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:17,697 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-12 21:59:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:17,699 INFO L225 Difference]: With dead ends: 1435 [2024-10-12 21:59:17,699 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 21:59:17,700 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-12 21:59:17,701 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-12 21:59:17,701 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-12 21:59:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 21:59:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-12 21:59:17,710 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-12 21:59:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1152 transitions. [2024-10-12 21:59:17,712 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1152 transitions. Word has length 266 [2024-10-12 21:59:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:17,712 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1152 transitions. [2024-10-12 21:59:17,712 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-12 21:59:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1152 transitions. [2024-10-12 21:59:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-12 21:59:17,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:17,714 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-12 21:59:17,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:59:17,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:17,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1445126934, now seen corresponding path program 1 times [2024-10-12 21:59:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:17,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866087761] [2024-10-12 21:59:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,082 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-12 21:59:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866087761] [2024-10-12 21:59:18,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866087761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:18,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283244925] [2024-10-12 21:59:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:18,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:18,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:18,085 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-12 21:59:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:18,194 INFO L93 Difference]: Finished difference Result 1435 states and 2129 transitions. [2024-10-12 21:59:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:18,194 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-12 21:59:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:18,197 INFO L225 Difference]: With dead ends: 1435 [2024-10-12 21:59:18,197 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 21:59:18,197 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-12 21:59:18,198 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-12 21:59:18,198 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-12 21:59:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 21:59:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-12 21:59:18,206 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-12 21:59:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1151 transitions. [2024-10-12 21:59:18,208 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1151 transitions. Word has length 268 [2024-10-12 21:59:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:18,209 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1151 transitions. [2024-10-12 21:59:18,209 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-12 21:59:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1151 transitions. [2024-10-12 21:59:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-12 21:59:18,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:18,211 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-12 21:59:18,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:59:18,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:18,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash 608704506, now seen corresponding path program 1 times [2024-10-12 21:59:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:18,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594790072] [2024-10-12 21:59:18,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:18,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-12 21:59:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594790072] [2024-10-12 21:59:18,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594790072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:18,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:18,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:18,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056459528] [2024-10-12 21:59:18,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:18,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:18,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:18,634 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-12 21:59:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:18,739 INFO L93 Difference]: Finished difference Result 1435 states and 2127 transitions. [2024-10-12 21:59:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:18,739 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-12 21:59:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:18,742 INFO L225 Difference]: With dead ends: 1435 [2024-10-12 21:59:18,743 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 21:59:18,743 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-12 21:59:18,745 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-12 21:59:18,745 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-12 21:59:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 21:59:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-12 21:59:18,757 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-12 21:59:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1150 transitions. [2024-10-12 21:59:18,760 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1150 transitions. Word has length 269 [2024-10-12 21:59:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:18,760 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1150 transitions. [2024-10-12 21:59:18,761 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-12 21:59:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1150 transitions. [2024-10-12 21:59:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-12 21:59:18,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:18,763 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-12 21:59:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:59:18,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:18,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash -140730010, now seen corresponding path program 1 times [2024-10-12 21:59:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453640967] [2024-10-12 21:59:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:19,171 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-12 21:59:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453640967] [2024-10-12 21:59:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453640967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:19,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:19,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081657201] [2024-10-12 21:59:19,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:19,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:19,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:19,175 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-12 21:59:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:19,290 INFO L93 Difference]: Finished difference Result 1435 states and 2125 transitions. [2024-10-12 21:59:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:19,291 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-12 21:59:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:19,294 INFO L225 Difference]: With dead ends: 1435 [2024-10-12 21:59:19,294 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 21:59:19,295 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-12 21:59:19,296 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-12 21:59:19,296 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-12 21:59:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 21:59:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-12 21:59:19,306 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-12 21:59:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1149 transitions. [2024-10-12 21:59:19,308 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1149 transitions. Word has length 270 [2024-10-12 21:59:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:19,309 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1149 transitions. [2024-10-12 21:59:19,309 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-12 21:59:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1149 transitions. [2024-10-12 21:59:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-12 21:59:19,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:19,312 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-12 21:59:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:59:19,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:19,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1686913485, now seen corresponding path program 1 times [2024-10-12 21:59:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385555456] [2024-10-12 21:59:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:20,088 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-12 21:59:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:20,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385555456] [2024-10-12 21:59:20,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385555456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:20,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:20,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171459337] [2024-10-12 21:59:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:20,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:20,090 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-12 21:59:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:20,186 INFO L93 Difference]: Finished difference Result 1435 states and 2123 transitions. [2024-10-12 21:59:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:20,186 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-12 21:59:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:20,189 INFO L225 Difference]: With dead ends: 1435 [2024-10-12 21:59:20,189 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 21:59:20,190 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-12 21:59:20,190 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-12 21:59:20,190 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-12 21:59:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 21:59:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-10-12 21:59:20,199 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-12 21:59:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1148 transitions. [2024-10-12 21:59:20,201 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1148 transitions. Word has length 271 [2024-10-12 21:59:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:20,201 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1148 transitions. [2024-10-12 21:59:20,202 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-12 21:59:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1148 transitions. [2024-10-12 21:59:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-12 21:59:20,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:20,204 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-12 21:59:20,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:59:20,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:20,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash -362255710, now seen corresponding path program 1 times [2024-10-12 21:59:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:20,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334579896] [2024-10-12 21:59:20,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:59:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:59:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:59:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 21:59:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 21:59:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:21,370 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-12 21:59:21,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334579896] [2024-10-12 21:59:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334579896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:21,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:21,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:59:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256452560] [2024-10-12 21:59:21,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:21,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:59:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:59:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:59:21,373 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-12 21:59:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:21,961 INFO L93 Difference]: Finished difference Result 2179 states and 3223 transitions. [2024-10-12 21:59:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:21,962 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-12 21:59:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:21,966 INFO L225 Difference]: With dead ends: 2179 [2024-10-12 21:59:21,966 INFO L226 Difference]: Without dead ends: 1420 [2024-10-12 21:59:21,968 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-12 21:59:21,968 INFO L432 NwaCegarLoop]: 1222 mSDtfsCounter, 1013 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:21,968 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.5s Time] [2024-10-12 21:59:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-10-12 21:59:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 835. [2024-10-12 21:59:21,987 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-12 21:59:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1235 transitions. [2024-10-12 21:59:21,990 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1235 transitions. Word has length 272 [2024-10-12 21:59:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:21,990 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1235 transitions. [2024-10-12 21:59:21,990 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-12 21:59:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1235 transitions. [2024-10-12 21:59:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-10-12 21:59:21,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:21,993 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-12 21:59:21,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:59:21,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:21,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1556960768, now seen corresponding path program 1 times [2024-10-12 21:59:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:21,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638652746] [2024-10-12 21:59:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:59:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 21:59:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 21:59:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 21:59:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:59:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:23,006 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-12 21:59:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638652746] [2024-10-12 21:59:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638652746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:23,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140185425] [2024-10-12 21:59:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:23,008 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-12 21:59:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:23,507 INFO L93 Difference]: Finished difference Result 1498 states and 2214 transitions. [2024-10-12 21:59:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:59:23,507 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-12 21:59:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:23,510 INFO L225 Difference]: With dead ends: 1498 [2024-10-12 21:59:23,510 INFO L226 Difference]: Without dead ends: 839 [2024-10-12 21:59:23,511 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-12 21:59:23,512 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 1071 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:23,512 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.5s Time] [2024-10-12 21:59:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-12 21:59:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2024-10-12 21:59:23,523 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-12 21:59:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1237 transitions. [2024-10-12 21:59:23,525 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1237 transitions. Word has length 273 [2024-10-12 21:59:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:23,526 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1237 transitions. [2024-10-12 21:59:23,526 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-12 21:59:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1237 transitions. [2024-10-12 21:59:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-12 21:59:23,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:23,530 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-12 21:59:23,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:59:23,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:23,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1401094713, now seen corresponding path program 1 times [2024-10-12 21:59:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766367813] [2024-10-12 21:59:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:59:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 21:59:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 21:59:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 21:59:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:59:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:24,984 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-12 21:59:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766367813] [2024-10-12 21:59:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766367813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 21:59:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594508454] [2024-10-12 21:59:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 21:59:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 21:59:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:59:24,986 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-12 21:59:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:26,174 INFO L93 Difference]: Finished difference Result 2377 states and 3511 transitions. [2024-10-12 21:59:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:59:26,175 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-12 21:59:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:26,180 INFO L225 Difference]: With dead ends: 2377 [2024-10-12 21:59:26,181 INFO L226 Difference]: Without dead ends: 1716 [2024-10-12 21:59:26,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:59:26,182 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3900 mSDsluCounter, 6490 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:26,183 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.1s Time] [2024-10-12 21:59:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-10-12 21:59:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1113. [2024-10-12 21:59:26,202 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-12 21:59:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1648 transitions. [2024-10-12 21:59:26,204 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1648 transitions. Word has length 274 [2024-10-12 21:59:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:26,205 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1648 transitions. [2024-10-12 21:59:26,205 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-12 21:59:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1648 transitions. [2024-10-12 21:59:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-12 21:59:26,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:26,207 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-12 21:59:26,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:59:26,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:26,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:26,207 INFO L85 PathProgramCache]: Analyzing trace with hash -579205461, now seen corresponding path program 1 times [2024-10-12 21:59:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672740022] [2024-10-12 21:59:26,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:26,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:59:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 21:59:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 21:59:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 21:59:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:59:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:26,707 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-12 21:59:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672740022] [2024-10-12 21:59:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672740022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:26,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402472179] [2024-10-12 21:59:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:26,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:26,709 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-12 21:59:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:27,003 INFO L93 Difference]: Finished difference Result 1990 states and 2944 transitions. [2024-10-12 21:59:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:27,003 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-12 21:59:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:27,007 INFO L225 Difference]: With dead ends: 1990 [2024-10-12 21:59:27,007 INFO L226 Difference]: Without dead ends: 1071 [2024-10-12 21:59:27,008 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-12 21:59:27,008 INFO L432 NwaCegarLoop]: 1266 mSDtfsCounter, 72 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:27,009 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.3s Time] [2024-10-12 21:59:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-12 21:59:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 912. [2024-10-12 21:59:27,024 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-12 21:59:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1348 transitions. [2024-10-12 21:59:27,026 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1348 transitions. Word has length 274 [2024-10-12 21:59:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1348 transitions. [2024-10-12 21:59:27,026 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-12 21:59:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1348 transitions. [2024-10-12 21:59:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-12 21:59:27,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:27,028 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-12 21:59:27,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:59:27,028 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash -213367870, now seen corresponding path program 1 times [2024-10-12 21:59:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846708708] [2024-10-12 21:59:27,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:27,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:59:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 21:59:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 21:59:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:59:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 21:59:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:28,161 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-12 21:59:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846708708] [2024-10-12 21:59:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846708708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:59:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626802322] [2024-10-12 21:59:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:28,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:59:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:59:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:59:28,163 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-12 21:59:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:28,867 INFO L93 Difference]: Finished difference Result 1598 states and 2359 transitions. [2024-10-12 21:59:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:28,867 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-12 21:59:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:28,870 INFO L225 Difference]: With dead ends: 1598 [2024-10-12 21:59:28,870 INFO L226 Difference]: Without dead ends: 920 [2024-10-12 21:59:28,871 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-12 21:59:28,871 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 1109 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:28,872 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.6s Time] [2024-10-12 21:59:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-12 21:59:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 916. [2024-10-12 21:59:28,883 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-12 21:59:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1350 transitions. [2024-10-12 21:59:28,884 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1350 transitions. Word has length 275 [2024-10-12 21:59:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:28,885 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1350 transitions. [2024-10-12 21:59:28,885 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-12 21:59:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1350 transitions. [2024-10-12 21:59:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-12 21:59:28,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:28,886 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-12 21:59:28,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:59:28,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:28,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1431111614, now seen corresponding path program 1 times [2024-10-12 21:59:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790915096] [2024-10-12 21:59:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:59:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:59:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:59:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 21:59:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 21:59:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-12 21:59:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-12 21:59:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:29,904 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-12 21:59:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790915096] [2024-10-12 21:59:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790915096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:59:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819618597] [2024-10-12 21:59:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:59:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:29,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:59:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:59:29,907 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-12 21:59:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:30,287 INFO L93 Difference]: Finished difference Result 1718 states and 2528 transitions. [2024-10-12 21:59:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:59:30,288 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-12 21:59:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:30,290 INFO L225 Difference]: With dead ends: 1718 [2024-10-12 21:59:30,291 INFO L226 Difference]: Without dead ends: 924 [2024-10-12 21:59:30,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:59:30,292 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:30,292 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.3s Time] [2024-10-12 21:59:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-10-12 21:59:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2024-10-12 21:59:30,303 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-12 21:59:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1352 transitions. [2024-10-12 21:59:30,304 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1352 transitions. Word has length 276 [2024-10-12 21:59:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:30,304 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1352 transitions. [2024-10-12 21:59:30,305 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-12 21:59:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1352 transitions. [2024-10-12 21:59:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-12 21:59:30,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:30,306 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-12 21:59:30,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:59:30,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 846537631, now seen corresponding path program 1 times [2024-10-12 21:59:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011148900] [2024-10-12 21:59:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:59:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 21:59:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 21:59:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 21:59:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 21:59:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:31,271 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-12 21:59:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011148900] [2024-10-12 21:59:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011148900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:31,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311413853] [2024-10-12 21:59:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:31,275 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-12 21:59:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:31,316 INFO L93 Difference]: Finished difference Result 1755 states and 2574 transitions. [2024-10-12 21:59:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:59:31,316 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-12 21:59:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:31,319 INFO L225 Difference]: With dead ends: 1755 [2024-10-12 21:59:31,319 INFO L226 Difference]: Without dead ends: 1090 [2024-10-12 21:59:31,320 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-12 21:59:31,321 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-12 21:59:31,321 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-12 21:59:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-10-12 21:59:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1088. [2024-10-12 21:59:31,337 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-12 21:59:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1594 transitions. [2024-10-12 21:59:31,339 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1594 transitions. Word has length 277 [2024-10-12 21:59:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:31,339 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1594 transitions. [2024-10-12 21:59:31,339 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-12 21:59:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1594 transitions. [2024-10-12 21:59:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-12 21:59:31,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:31,341 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-12 21:59:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:59:31,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:31,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1381751004, now seen corresponding path program 1 times [2024-10-12 21:59:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165843977] [2024-10-12 21:59:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:59:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 21:59:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 21:59:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 21:59:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 21:59:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:32,490 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-12 21:59:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165843977] [2024-10-12 21:59:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165843977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:32,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 21:59:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750832149] [2024-10-12 21:59:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:32,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 21:59:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 21:59:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:59:32,492 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-12 21:59:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:33,589 INFO L93 Difference]: Finished difference Result 2957 states and 4324 transitions. [2024-10-12 21:59:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:59:33,590 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-12 21:59:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:33,600 INFO L225 Difference]: With dead ends: 2957 [2024-10-12 21:59:33,600 INFO L226 Difference]: Without dead ends: 2124 [2024-10-12 21:59:33,602 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-12 21:59:33,603 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 3678 mSDsluCounter, 6304 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:33,603 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.0s Time] [2024-10-12 21:59:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-10-12 21:59:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1367. [2024-10-12 21:59:33,631 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-12 21:59:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2001 transitions. [2024-10-12 21:59:33,633 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2001 transitions. Word has length 278 [2024-10-12 21:59:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:33,634 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2001 transitions. [2024-10-12 21:59:33,634 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-12 21:59:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2001 transitions. [2024-10-12 21:59:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-12 21:59:33,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:33,637 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-12 21:59:33,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:59:33,637 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:33,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:33,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1036907884, now seen corresponding path program 1 times [2024-10-12 21:59:33,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:33,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786586625] [2024-10-12 21:59:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:59:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 21:59:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 21:59:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 21:59:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 21:59:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:34,814 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-12 21:59:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786586625] [2024-10-12 21:59:34,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786586625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:34,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:59:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757083980] [2024-10-12 21:59:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:59:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:59:34,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:59:34,817 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-12 21:59:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:35,010 INFO L93 Difference]: Finished difference Result 2903 states and 4247 transitions. [2024-10-12 21:59:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:59:35,011 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-12 21:59:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:35,017 INFO L225 Difference]: With dead ends: 2903 [2024-10-12 21:59:35,018 INFO L226 Difference]: Without dead ends: 2054 [2024-10-12 21:59:35,019 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-12 21:59:35,019 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:35,020 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.1s Time] [2024-10-12 21:59:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-10-12 21:59:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1369. [2024-10-12 21:59:35,045 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-12 21:59:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2001 transitions. [2024-10-12 21:59:35,048 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2001 transitions. Word has length 279 [2024-10-12 21:59:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:35,049 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2001 transitions. [2024-10-12 21:59:35,049 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-12 21:59:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2001 transitions. [2024-10-12 21:59:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-12 21:59:35,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:35,053 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-12 21:59:35,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:59:35,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:35,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash 496820035, now seen corresponding path program 1 times [2024-10-12 21:59:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967858842] [2024-10-12 21:59:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:59:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 21:59:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 21:59:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 21:59:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 21:59:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 21:59:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 21:59:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:35,979 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-12 21:59:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967858842] [2024-10-12 21:59:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967858842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106877538] [2024-10-12 21:59:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:35,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:35,980 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-12 21:59:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:36,472 INFO L93 Difference]: Finished difference Result 2206 states and 3225 transitions. [2024-10-12 21:59:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:59:36,473 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-12 21:59:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:36,485 INFO L225 Difference]: With dead ends: 2206 [2024-10-12 21:59:36,485 INFO L226 Difference]: Without dead ends: 1373 [2024-10-12 21:59:36,486 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-12 21:59:36,486 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 984 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:36,487 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.5s Time] [2024-10-12 21:59:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-12 21:59:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1371. [2024-10-12 21:59:36,524 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-12 21:59:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2003 transitions. [2024-10-12 21:59:36,528 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2003 transitions. Word has length 279 [2024-10-12 21:59:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:36,529 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2003 transitions. [2024-10-12 21:59:36,530 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-12 21:59:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2003 transitions. [2024-10-12 21:59:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-12 21:59:36,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:36,532 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-12 21:59:36,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:59:36,532 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1128409508, now seen corresponding path program 1 times [2024-10-12 21:59:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:36,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541893276] [2024-10-12 21:59:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:59:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 21:59:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 21:59:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 21:59:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 21:59:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 21:59:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 21:59:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:37,452 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-12 21:59:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:37,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541893276] [2024-10-12 21:59:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541893276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:37,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:37,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:59:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225397962] [2024-10-12 21:59:37,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:37,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:59:37,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:59:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:59:37,455 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-12 21:59:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:37,663 INFO L93 Difference]: Finished difference Result 3177 states and 4640 transitions. [2024-10-12 21:59:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:59:37,663 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-12 21:59:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:37,670 INFO L225 Difference]: With dead ends: 3177 [2024-10-12 21:59:37,670 INFO L226 Difference]: Without dead ends: 2318 [2024-10-12 21:59:37,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:59:37,672 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-12 21:59:37,672 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-12 21:59:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-10-12 21:59:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1579. [2024-10-12 21:59:37,703 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-12 21:59:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2303 transitions. [2024-10-12 21:59:37,705 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2303 transitions. Word has length 279 [2024-10-12 21:59:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:37,706 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2303 transitions. [2024-10-12 21:59:37,706 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-12 21:59:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2303 transitions. [2024-10-12 21:59:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-12 21:59:37,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:37,709 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-12 21:59:37,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:59:37,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:37,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash 383315571, now seen corresponding path program 1 times [2024-10-12 21:59:37,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:37,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142611766] [2024-10-12 21:59:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:59:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 21:59:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 21:59:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 21:59:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:59:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:38,438 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-12 21:59:38,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:38,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142611766] [2024-10-12 21:59:38,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142611766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:38,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:38,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743932209] [2024-10-12 21:59:38,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:38,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:38,441 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-12 21:59:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:39,015 INFO L93 Difference]: Finished difference Result 2467 states and 3599 transitions. [2024-10-12 21:59:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:39,016 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-12 21:59:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:39,020 INFO L225 Difference]: With dead ends: 2467 [2024-10-12 21:59:39,020 INFO L226 Difference]: Without dead ends: 1579 [2024-10-12 21:59:39,022 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-12 21:59:39,022 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-12 21:59:39,023 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-12 21:59:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-10-12 21:59:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2024-10-12 21:59:39,055 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-12 21:59:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2301 transitions. [2024-10-12 21:59:39,058 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2301 transitions. Word has length 280 [2024-10-12 21:59:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:39,059 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2301 transitions. [2024-10-12 21:59:39,059 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-12 21:59:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2301 transitions. [2024-10-12 21:59:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-12 21:59:39,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:39,062 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-12 21:59:39,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:59:39,063 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:39,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1003476456, now seen corresponding path program 1 times [2024-10-12 21:59:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:39,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635158927] [2024-10-12 21:59:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:59:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 21:59:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 21:59:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 21:59:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:59:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:40,257 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-12 21:59:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635158927] [2024-10-12 21:59:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635158927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:59:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186349247] [2024-10-12 21:59:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:40,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:59:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:59:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:59:40,259 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-12 21:59:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:40,494 INFO L93 Difference]: Finished difference Result 3140 states and 4577 transitions. [2024-10-12 21:59:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:59:40,495 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-12 21:59:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:40,505 INFO L225 Difference]: With dead ends: 3140 [2024-10-12 21:59:40,505 INFO L226 Difference]: Without dead ends: 2250 [2024-10-12 21:59:40,509 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-12 21:59:40,509 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:40,510 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.1s Time] [2024-10-12 21:59:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2024-10-12 21:59:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1577. [2024-10-12 21:59:40,535 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-12 21:59:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2297 transitions. [2024-10-12 21:59:40,537 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2297 transitions. Word has length 281 [2024-10-12 21:59:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:40,538 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2297 transitions. [2024-10-12 21:59:40,538 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-12 21:59:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2297 transitions. [2024-10-12 21:59:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-12 21:59:40,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:40,541 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-12 21:59:40,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:59:40,541 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:40,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1840225623, now seen corresponding path program 1 times [2024-10-12 21:59:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:40,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997837984] [2024-10-12 21:59:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:59:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 21:59:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 21:59:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 21:59:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 21:59:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 21:59:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:59:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:41,390 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-12 21:59:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997837984] [2024-10-12 21:59:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997837984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:59:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131021021] [2024-10-12 21:59:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:41,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:59:41,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:59:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:59:41,392 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-12 21:59:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:42,059 INFO L93 Difference]: Finished difference Result 2469 states and 3597 transitions. [2024-10-12 21:59:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:42,059 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-12 21:59:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:42,063 INFO L225 Difference]: With dead ends: 2469 [2024-10-12 21:59:42,064 INFO L226 Difference]: Without dead ends: 1581 [2024-10-12 21:59:42,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:59:42,065 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-12 21:59:42,066 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-12 21:59:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-12 21:59:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1578. [2024-10-12 21:59:42,087 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-12 21:59:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2297 transitions. [2024-10-12 21:59:42,089 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2297 transitions. Word has length 281 [2024-10-12 21:59:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:42,089 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2297 transitions. [2024-10-12 21:59:42,090 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-12 21:59:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2297 transitions. [2024-10-12 21:59:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-12 21:59:42,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:42,092 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-12 21:59:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:59:42,092 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:42,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1063949607, now seen corresponding path program 1 times [2024-10-12 21:59:42,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:42,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490322420] [2024-10-12 21:59:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:42,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:59:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 21:59:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 21:59:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 21:59:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-12 21:59:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,052 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-12 21:59:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:43,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490322420] [2024-10-12 21:59:43,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490322420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:43,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:43,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:59:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137712529] [2024-10-12 21:59:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:43,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:59:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:43,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:59:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:59:43,054 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-12 21:59:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:43,174 INFO L93 Difference]: Finished difference Result 2661 states and 3867 transitions. [2024-10-12 21:59:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:59:43,174 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-12 21:59:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:43,177 INFO L225 Difference]: With dead ends: 2661 [2024-10-12 21:59:43,177 INFO L226 Difference]: Without dead ends: 1594 [2024-10-12 21:59:43,178 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-12 21:59:43,179 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-12 21:59:43,179 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-12 21:59:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-12 21:59:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1586. [2024-10-12 21:59:43,198 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-12 21:59:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2301 transitions. [2024-10-12 21:59:43,200 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2301 transitions. Word has length 282 [2024-10-12 21:59:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2301 transitions. [2024-10-12 21:59:43,200 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-12 21:59:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2301 transitions. [2024-10-12 21:59:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-12 21:59:43,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:43,203 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-12 21:59:43,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:59:43,203 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:43,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1153196902, now seen corresponding path program 1 times [2024-10-12 21:59:43,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:43,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359550834] [2024-10-12 21:59:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:43,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:59:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 21:59:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 21:59:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-12 21:59:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:43,580 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-12 21:59:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359550834] [2024-10-12 21:59:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359550834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39811280] [2024-10-12 21:59:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:43,582 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-12 21:59:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:44,081 INFO L93 Difference]: Finished difference Result 2679 states and 3888 transitions. [2024-10-12 21:59:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:59:44,081 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-12 21:59:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:44,085 INFO L225 Difference]: With dead ends: 2679 [2024-10-12 21:59:44,085 INFO L226 Difference]: Without dead ends: 1594 [2024-10-12 21:59:44,086 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-12 21:59:44,086 INFO L432 NwaCegarLoop]: 841 mSDtfsCounter, 1105 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-12 21:59:44,087 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-12 21:59:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-12 21:59:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2024-10-12 21:59:44,106 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-12 21:59:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2309 transitions. [2024-10-12 21:59:44,108 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2309 transitions. Word has length 282 [2024-10-12 21:59:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:44,108 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 2309 transitions. [2024-10-12 21:59:44,108 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-12 21:59:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2309 transitions. [2024-10-12 21:59:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-12 21:59:44,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:44,111 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-12 21:59:44,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:59:44,111 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:44,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1786164281, now seen corresponding path program 1 times [2024-10-12 21:59:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:44,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388151965] [2024-10-12 21:59:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 21:59:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 21:59:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 21:59:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 21:59:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-12 21:59:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:44,468 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-12 21:59:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388151965] [2024-10-12 21:59:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388151965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:44,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:44,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:59:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548339849] [2024-10-12 21:59:44,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:44,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:59:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:59:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:59:44,470 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-12 21:59:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:45,056 INFO L93 Difference]: Finished difference Result 2790 states and 4041 transitions. [2024-10-12 21:59:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:45,057 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-12 21:59:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:45,059 INFO L225 Difference]: With dead ends: 2790 [2024-10-12 21:59:45,060 INFO L226 Difference]: Without dead ends: 1626 [2024-10-12 21:59:45,061 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-12 21:59:45,062 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-12 21:59:45,062 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-12 21:59:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-12 21:59:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1610. [2024-10-12 21:59:45,082 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-12 21:59:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2325 transitions. [2024-10-12 21:59:45,084 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2325 transitions. Word has length 283 [2024-10-12 21:59:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:45,084 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2325 transitions. [2024-10-12 21:59:45,084 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-12 21:59:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2325 transitions. [2024-10-12 21:59:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-12 21:59:45,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:45,087 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-12 21:59:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:59:45,087 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:45,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1150492649, now seen corresponding path program 1 times [2024-10-12 21:59:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642593051] [2024-10-12 21:59:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:59:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 21:59:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 21:59:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 21:59:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 21:59:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 21:59:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-12 21:59:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:45,526 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-12 21:59:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642593051] [2024-10-12 21:59:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642593051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:45,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:45,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:59:45,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034385377] [2024-10-12 21:59:45,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:45,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:59:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:45,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:59:45,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:59:45,528 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-12 21:59:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:46,527 INFO L93 Difference]: Finished difference Result 3454 states and 5001 transitions. [2024-10-12 21:59:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:46,527 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-12 21:59:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:46,531 INFO L225 Difference]: With dead ends: 3454 [2024-10-12 21:59:46,531 INFO L226 Difference]: Without dead ends: 2556 [2024-10-12 21:59:46,532 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-12 21:59:46,533 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, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:46,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 4939 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:59:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-10-12 21:59:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1901. [2024-10-12 21:59:46,561 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-12 21:59:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2742 transitions. [2024-10-12 21:59:46,563 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2742 transitions. Word has length 283 [2024-10-12 21:59:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:46,563 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2742 transitions. [2024-10-12 21:59:46,563 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-12 21:59:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2742 transitions. [2024-10-12 21:59:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-10-12 21:59:46,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:46,566 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-12 21:59:46,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 21:59:46,567 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:46,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1045814496, now seen corresponding path program 1 times [2024-10-12 21:59:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607904434] [2024-10-12 21:59:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,071 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-12 21:59:47,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:47,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607904434] [2024-10-12 21:59:47,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607904434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:47,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:47,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129613982] [2024-10-12 21:59:47,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:47,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:47,073 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-12 21:59:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:47,446 INFO L93 Difference]: Finished difference Result 2897 states and 4185 transitions. [2024-10-12 21:59:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:47,447 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-12 21:59:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:47,450 INFO L225 Difference]: With dead ends: 2897 [2024-10-12 21:59:47,450 INFO L226 Difference]: Without dead ends: 1901 [2024-10-12 21:59:47,451 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-12 21:59:47,452 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 998 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:47,452 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.3s Time] [2024-10-12 21:59:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-12 21:59:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1901. [2024-10-12 21:59:47,475 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-12 21:59:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2740 transitions. [2024-10-12 21:59:47,478 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2740 transitions. Word has length 284 [2024-10-12 21:59:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:47,478 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2740 transitions. [2024-10-12 21:59:47,478 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-12 21:59:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2740 transitions. [2024-10-12 21:59:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-12 21:59:47,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:47,481 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-12 21:59:47,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 21:59:47,481 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:47,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash -689422274, now seen corresponding path program 1 times [2024-10-12 21:59:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116271049] [2024-10-12 21:59:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:47,884 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-12 21:59:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116271049] [2024-10-12 21:59:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116271049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:59:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450245275] [2024-10-12 21:59:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:59:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:59:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:59:47,886 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-12 21:59:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:47,938 INFO L93 Difference]: Finished difference Result 3330 states and 4804 transitions. [2024-10-12 21:59:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:47,939 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-12 21:59:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:47,942 INFO L225 Difference]: With dead ends: 3330 [2024-10-12 21:59:47,942 INFO L226 Difference]: Without dead ends: 1877 [2024-10-12 21:59:47,944 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-12 21:59:47,945 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-12 21:59:47,945 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-12 21:59:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-12 21:59:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2024-10-12 21:59:47,994 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-12 21:59:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2704 transitions. [2024-10-12 21:59:48,000 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2704 transitions. Word has length 285 [2024-10-12 21:59:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:48,000 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2704 transitions. [2024-10-12 21:59:48,001 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-12 21:59:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2704 transitions. [2024-10-12 21:59:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-12 21:59:48,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:48,009 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-12 21:59:48,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 21:59:48,009 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:48,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 800557786, now seen corresponding path program 1 times [2024-10-12 21:59:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913131348] [2024-10-12 21:59:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:48,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:48,998 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-12 21:59:48,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:48,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913131348] [2024-10-12 21:59:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913131348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:48,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:59:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147577561] [2024-10-12 21:59:48,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:48,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:59:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:59:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:59:49,000 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-12 21:59:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:49,135 INFO L93 Difference]: Finished difference Result 3522 states and 5073 transitions. [2024-10-12 21:59:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:49,135 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-12 21:59:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:49,139 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:49,139 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:49,140 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-12 21:59:49,141 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-12 21:59:49,141 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-12 21:59:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:49,175 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-12 21:59:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3640 transitions. [2024-10-12 21:59:49,178 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3640 transitions. Word has length 285 [2024-10-12 21:59:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:49,178 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3640 transitions. [2024-10-12 21:59:49,178 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-12 21:59:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3640 transitions. [2024-10-12 21:59:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2024-10-12 21:59:49,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:49,183 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-12 21:59:49,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 21:59:49,184 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -267985809, now seen corresponding path program 1 times [2024-10-12 21:59:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117966585] [2024-10-12 21:59:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2024-10-12 21:59:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-10-12 21:59:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2024-10-12 21:59:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2024-10-12 21:59:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 515 [2024-10-12 21:59:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-10-12 21:59:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2024-10-12 21:59:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:50,092 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-12 21:59:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117966585] [2024-10-12 21:59:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117966585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783916580] [2024-10-12 21:59:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:50,094 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-12 21:59:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:50,198 INFO L93 Difference]: Finished difference Result 3522 states and 5072 transitions. [2024-10-12 21:59:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:50,199 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-12 21:59:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:50,203 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:50,203 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:50,204 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-12 21:59:50,204 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-12 21:59:50,204 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-12 21:59:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:50,235 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-12 21:59:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3639 transitions. [2024-10-12 21:59:50,238 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3639 transitions. Word has length 665 [2024-10-12 21:59:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:50,239 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3639 transitions. [2024-10-12 21:59:50,239 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-12 21:59:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3639 transitions. [2024-10-12 21:59:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2024-10-12 21:59:50,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:50,244 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-12 21:59:50,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 21:59:50,244 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:50,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1965256542, now seen corresponding path program 1 times [2024-10-12 21:59:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843754646] [2024-10-12 21:59:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 454 [2024-10-12 21:59:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 468 [2024-10-12 21:59:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-10-12 21:59:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 505 [2024-10-12 21:59:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516 [2024-10-12 21:59:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 529 [2024-10-12 21:59:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2024-10-12 21:59:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:51,268 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-12 21:59:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843754646] [2024-10-12 21:59:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843754646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:51,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:51,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:51,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906852004] [2024-10-12 21:59:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:51,272 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-12 21:59:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:51,373 INFO L93 Difference]: Finished difference Result 3522 states and 5070 transitions. [2024-10-12 21:59:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:51,376 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-12 21:59:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:51,381 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:51,381 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:51,382 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-12 21:59:51,384 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-12 21:59:51,385 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-12 21:59:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:51,418 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-12 21:59:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3638 transitions. [2024-10-12 21:59:51,421 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3638 transitions. Word has length 666 [2024-10-12 21:59:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:51,422 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3638 transitions. [2024-10-12 21:59:51,422 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-12 21:59:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3638 transitions. [2024-10-12 21:59:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2024-10-12 21:59:51,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:51,427 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-12 21:59:51,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 21:59:51,427 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:51,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash -287194822, now seen corresponding path program 1 times [2024-10-12 21:59:51,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:51,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502823914] [2024-10-12 21:59:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2024-10-12 21:59:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2024-10-12 21:59:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-10-12 21:59:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2024-10-12 21:59:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2024-10-12 21:59:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-10-12 21:59:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2024-10-12 21:59:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:52,408 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-12 21:59:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502823914] [2024-10-12 21:59:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502823914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:52,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:52,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841354859] [2024-10-12 21:59:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:52,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:52,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:52,410 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-12 21:59:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:52,795 INFO L93 Difference]: Finished difference Result 3522 states and 5068 transitions. [2024-10-12 21:59:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:52,796 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-12 21:59:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:52,800 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:52,800 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:52,801 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-12 21:59:52,802 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:52,802 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.3s Time] [2024-10-12 21:59:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:52,831 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-12 21:59:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3637 transitions. [2024-10-12 21:59:52,834 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3637 transitions. Word has length 667 [2024-10-12 21:59:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:52,834 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3637 transitions. [2024-10-12 21:59:52,835 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-12 21:59:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3637 transitions. [2024-10-12 21:59:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2024-10-12 21:59:52,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:52,840 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-12 21:59:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 21:59:52,840 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1355514359, now seen corresponding path program 1 times [2024-10-12 21:59:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878326665] [2024-10-12 21:59:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-10-12 21:59:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2024-10-12 21:59:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2024-10-12 21:59:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2024-10-12 21:59:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2024-10-12 21:59:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 531 [2024-10-12 21:59:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 544 [2024-10-12 21:59:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:54,023 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-12 21:59:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878326665] [2024-10-12 21:59:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878326665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:54,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:54,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110906796] [2024-10-12 21:59:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:54,026 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-12 21:59:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:54,128 INFO L93 Difference]: Finished difference Result 3522 states and 5066 transitions. [2024-10-12 21:59:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:54,129 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-12 21:59:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:54,133 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:54,133 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:54,135 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-12 21:59:54,135 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-12 21:59:54,136 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-12 21:59:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:54,167 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-12 21:59:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3636 transitions. [2024-10-12 21:59:54,171 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3636 transitions. Word has length 668 [2024-10-12 21:59:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:54,173 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3636 transitions. [2024-10-12 21:59:54,173 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-12 21:59:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3636 transitions. [2024-10-12 21:59:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2024-10-12 21:59:54,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:54,179 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-12 21:59:54,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 21:59:54,179 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:54,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1483433202, now seen corresponding path program 1 times [2024-10-12 21:59:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:54,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139587664] [2024-10-12 21:59:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-10-12 21:59:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-10-12 21:59:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2024-10-12 21:59:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2024-10-12 21:59:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2024-10-12 21:59:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 532 [2024-10-12 21:59:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 545 [2024-10-12 21:59:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:55,192 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-12 21:59:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:55,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139587664] [2024-10-12 21:59:55,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139587664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:55,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:55,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272120386] [2024-10-12 21:59:55,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:55,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:55,195 INFO L87 Difference]: Start difference. First operand 2532 states and 3636 transitions. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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-12 21:59:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:55,294 INFO L93 Difference]: Finished difference Result 3522 states and 5064 transitions. [2024-10-12 21:59:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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 669 [2024-10-12 21:59:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:55,299 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:55,299 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:55,301 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-12 21:59:55,301 INFO L432 NwaCegarLoop]: 1087 mSDtfsCounter, 932 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:55,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2186 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:59:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.4219066937119675) internal successors, (3505), 2465 states have internal predecessors, (3505), 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-12 21:59:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3635 transitions. [2024-10-12 21:59:55,335 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3635 transitions. Word has length 669 [2024-10-12 21:59:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:55,335 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3635 transitions. [2024-10-12 21:59:55,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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-12 21:59:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3635 transitions. [2024-10-12 21:59:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-10-12 21:59:55,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:55,341 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, 1] [2024-10-12 21:59:55,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 21:59:55,341 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1730710252, now seen corresponding path program 1 times [2024-10-12 21:59:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152734820] [2024-10-12 21:59:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-10-12 21:59:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2024-10-12 21:59:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-10-12 21:59:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-12 21:59:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520 [2024-10-12 21:59:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-10-12 21:59:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2024-10-12 21:59:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:56,387 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-12 21:59:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152734820] [2024-10-12 21:59:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152734820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:59:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356001784] [2024-10-12 21:59:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:56,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:59:56,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:56,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:59:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:59:56,389 INFO L87 Difference]: Start difference. First operand 2532 states and 3635 transitions. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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-12 21:59:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:56,781 INFO L93 Difference]: Finished difference Result 3522 states and 5062 transitions. [2024-10-12 21:59:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:59:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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 670 [2024-10-12 21:59:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:56,786 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 21:59:56,786 INFO L226 Difference]: Without dead ends: 2532 [2024-10-12 21:59:56,787 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-12 21:59:56,787 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 1605 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:56,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 1648 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:59:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-12 21:59:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2024-10-12 21:59:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2465 states have (on average 1.421501014198783) internal successors, (3504), 2465 states have internal predecessors, (3504), 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-12 21:59:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3634 transitions. [2024-10-12 21:59:56,822 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3634 transitions. Word has length 670 [2024-10-12 21:59:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:56,823 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3634 transitions. [2024-10-12 21:59:56,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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-12 21:59:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3634 transitions. [2024-10-12 21:59:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-12 21:59:56,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:56,829 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, 1, 1] [2024-10-12 21:59:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 21:59:56,829 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1405034105, now seen corresponding path program 1 times [2024-10-12 21:59:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421148898] [2024-10-12 21:59:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:59:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:59:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:59:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:59:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 21:59:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 21:59:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 21:59:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 21:59:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-10-12 21:59:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 473 [2024-10-12 21:59:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 494 [2024-10-12 21:59:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2024-10-12 21:59:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521 [2024-10-12 21:59:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 534 [2024-10-12 21:59:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-10-12 21:59:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:59:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-10-12 21:59:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:59:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421148898] [2024-10-12 21:59:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421148898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:59:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:59:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:59:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452070334] [2024-10-12 21:59:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:59:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:59:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:59:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:59:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:59:57,992 INFO L87 Difference]: Start difference. First operand 2532 states and 3634 transitions. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 21:59:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:59:58,601 INFO L93 Difference]: Finished difference Result 3984 states and 5722 transitions. [2024-10-12 21:59:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:59:58,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 671 [2024-10-12 21:59:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:59:58,605 INFO L225 Difference]: With dead ends: 3984 [2024-10-12 21:59:58,605 INFO L226 Difference]: Without dead ends: 2556 [2024-10-12 21:59:58,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-12 21:59:58,607 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 762 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 3310 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:59:58,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 3310 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:59:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-10-12 21:59:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2518. [2024-10-12 21:59:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2451 states have (on average 1.4206446348429214) internal successors, (3482), 2451 states have internal predecessors, (3482), 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-12 21:59:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3612 transitions. [2024-10-12 21:59:58,637 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3612 transitions. Word has length 671 [2024-10-12 21:59:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:59:58,638 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3612 transitions. [2024-10-12 21:59:58,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 21:59:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3612 transitions. [2024-10-12 21:59:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-12 21:59:58,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:59:58,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:59:58,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 21:59:58,643 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:59:58,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:59:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1693133196, now seen corresponding path program 1 times [2024-10-12 21:59:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:59:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052132363] [2024-10-12 21:59:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:59:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:00:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:00:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 22:00:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 22:00:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 22:00:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 22:00:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 22:00:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 22:00:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-10-12 22:00:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 473 [2024-10-12 22:00:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 494 [2024-10-12 22:00:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2024-10-12 22:00:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521 [2024-10-12 22:00:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-10-12 22:00:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2024-10-12 22:00:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 22:00:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:00:01,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052132363] [2024-10-12 22:00:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052132363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:00:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:00:01,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:00:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290530365] [2024-10-12 22:00:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:00:01,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:00:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:00:01,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:00:01,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:00:01,106 INFO L87 Difference]: Start difference. First operand 2518 states and 3612 transitions. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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-12 22:00:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:00:01,198 INFO L93 Difference]: Finished difference Result 3512 states and 5042 transitions. [2024-10-12 22:00:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:00:01,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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 671 [2024-10-12 22:00:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:00:01,202 INFO L225 Difference]: With dead ends: 3512 [2024-10-12 22:00:01,202 INFO L226 Difference]: Without dead ends: 2518 [2024-10-12 22:00:01,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-12 22:00:01,203 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 830 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:00:01,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 2174 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:00:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2024-10-12 22:00:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2518. [2024-10-12 22:00:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2451 states have (on average 1.4202366381068952) internal successors, (3481), 2451 states have internal predecessors, (3481), 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-12 22:00:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3611 transitions. [2024-10-12 22:00:01,234 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3611 transitions. Word has length 671 [2024-10-12 22:00:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:00:01,235 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3611 transitions. [2024-10-12 22:00:01,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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-12 22:00:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3611 transitions. [2024-10-12 22:00:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2024-10-12 22:00:01,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:00:01,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:00:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 22:00:01,241 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:00:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:00:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash -561210355, now seen corresponding path program 1 times [2024-10-12 22:00:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:00:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647083327] [2024-10-12 22:00:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:00:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:00:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:00:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 22:00:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 22:00:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 22:00:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 22:00:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 22:00:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 22:00:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2024-10-12 22:00:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2024-10-12 22:00:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-10-12 22:00:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-10-12 22:00:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2024-10-12 22:00:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 534 [2024-10-12 22:00:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-10-12 22:00:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 22:00:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:00:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647083327] [2024-10-12 22:00:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647083327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:00:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:00:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:00:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907672975] [2024-10-12 22:00:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:00:03,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:00:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:00:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:00:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:00:03,205 INFO L87 Difference]: Start difference. First operand 2518 states and 3611 transitions. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 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-12 22:00:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:00:03,294 INFO L93 Difference]: Finished difference Result 3512 states and 5040 transitions. [2024-10-12 22:00:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:00:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 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 672 [2024-10-12 22:00:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:00:03,300 INFO L225 Difference]: With dead ends: 3512 [2024-10-12 22:00:03,300 INFO L226 Difference]: Without dead ends: 2518 [2024-10-12 22:00:03,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-12 22:00:03,302 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 773 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:00:03,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2174 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:00:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2024-10-12 22:00:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2518. [2024-10-12 22:00:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2451 states have (on average 1.419828641370869) internal successors, (3480), 2451 states have internal predecessors, (3480), 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-12 22:00:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3610 transitions. [2024-10-12 22:00:03,336 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3610 transitions. Word has length 672 [2024-10-12 22:00:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:00:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3610 transitions. [2024-10-12 22:00:03,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 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-12 22:00:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3610 transitions. [2024-10-12 22:00:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2024-10-12 22:00:03,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:00:03,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:00:03,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 22:00:03,342 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:00:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:00:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1750008460, now seen corresponding path program 1 times [2024-10-12 22:00:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:00:03,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026285238] [2024-10-12 22:00:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:00:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:00:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:00:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 22:00:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 22:00:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 22:00:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 22:00:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 22:00:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 22:00:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-10-12 22:00:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2024-10-12 22:00:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2024-10-12 22:00:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2024-10-12 22:00:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-10-12 22:00:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-10-12 22:00:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2024-10-12 22:00:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 22:00:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:00:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026285238] [2024-10-12 22:00:06,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026285238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:00:06,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:00:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:00:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424064616] [2024-10-12 22:00:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:00:06,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:00:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:00:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:00:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:00:06,580 INFO L87 Difference]: Start difference. First operand 2518 states and 3610 transitions. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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-12 22:00:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:00:07,121 INFO L93 Difference]: Finished difference Result 5433 states and 7791 transitions. [2024-10-12 22:00:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:00:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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 673 [2024-10-12 22:00:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:00:07,130 INFO L225 Difference]: With dead ends: 5433 [2024-10-12 22:00:07,130 INFO L226 Difference]: Without dead ends: 4439 [2024-10-12 22:00:07,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:00:07,135 INFO L432 NwaCegarLoop]: 1656 mSDtfsCounter, 1138 mSDsluCounter, 4255 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:00:07,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 5911 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:00:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2024-10-12 22:00:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 4180. [2024-10-12 22:00:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4180 states, 4063 states have (on average 1.4171794240708835) internal successors, (5758), 4063 states have internal predecessors, (5758), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2024-10-12 22:00:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 4180 states and 5988 transitions. [2024-10-12 22:00:07,201 INFO L78 Accepts]: Start accepts. Automaton has 4180 states and 5988 transitions. Word has length 673 [2024-10-12 22:00:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:00:07,201 INFO L471 AbstractCegarLoop]: Abstraction has 4180 states and 5988 transitions. [2024-10-12 22:00:07,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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-12 22:00:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4180 states and 5988 transitions. [2024-10-12 22:00:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2024-10-12 22:00:07,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:00:07,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:00:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 22:00:07,212 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:00:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:00:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -32372316, now seen corresponding path program 1 times [2024-10-12 22:00:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:00:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333419839] [2024-10-12 22:00:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:00:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:00:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:00:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 22:00:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 22:00:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 22:00:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 22:00:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 22:00:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 22:00:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-10-12 22:00:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-10-12 22:00:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-10-12 22:00:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-10-12 22:00:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-10-12 22:00:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-10-12 22:00:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 549 [2024-10-12 22:00:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2024-10-12 22:00:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:00:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333419839] [2024-10-12 22:00:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333419839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:00:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:00:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:00:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559146272] [2024-10-12 22:00:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:00:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:00:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:00:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:00:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:00:11,522 INFO L87 Difference]: Start difference. First operand 4180 states and 5988 transitions. Second operand has 8 states, 8 states have (on average 62.125) internal successors, (497), 8 states have internal predecessors, (497), 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-12 22:00:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:00:12,944 INFO L93 Difference]: Finished difference Result 8920 states and 12780 transitions. [2024-10-12 22:00:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:00:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 62.125) internal successors, (497), 8 states have internal predecessors, (497), 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 674 [2024-10-12 22:00:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:00:12,953 INFO L225 Difference]: With dead ends: 8920 [2024-10-12 22:00:12,953 INFO L226 Difference]: Without dead ends: 7546 [2024-10-12 22:00:12,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:00:12,957 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 3492 mSDsluCounter, 5598 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3506 SdHoareTripleChecker+Valid, 6986 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:00:12,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3506 Valid, 6986 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 22:00:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2024-10-12 22:00:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5242. [2024-10-12 22:00:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 5075 states have (on average 1.4130049261083744) internal successors, (7171), 5075 states have internal predecessors, (7171), 165 states have call successors, (165), 1 states have call predecessors, (165), 1 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-12 22:00:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 7501 transitions. [2024-10-12 22:00:13,082 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 7501 transitions. Word has length 674 [2024-10-12 22:00:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:00:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 5242 states and 7501 transitions. [2024-10-12 22:00:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 62.125) internal successors, (497), 8 states have internal predecessors, (497), 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-12 22:00:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 7501 transitions. [2024-10-12 22:00:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2024-10-12 22:00:13,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:00:13,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:00:13,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 22:00:13,091 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:00:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:00:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1926622724, now seen corresponding path program 1 times [2024-10-12 22:00:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:00:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989845989] [2024-10-12 22:00:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:00:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:00:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:00:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 22:00:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 22:00:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 22:00:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 22:00:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 22:00:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 22:00:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-10-12 22:00:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-10-12 22:00:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-10-12 22:00:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-10-12 22:00:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-10-12 22:00:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-10-12 22:00:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 549 [2024-10-12 22:00:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-10-12 22:00:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:00:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989845989] [2024-10-12 22:00:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989845989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:00:17,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:00:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:00:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947445814] [2024-10-12 22:00:17,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:00:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:00:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:00:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:00:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:00:17,506 INFO L87 Difference]: Start difference. First operand 5242 states and 7501 transitions. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 22:00:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:00:17,662 INFO L93 Difference]: Finished difference Result 8109 states and 11627 transitions. [2024-10-12 22:00:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:00:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 674 [2024-10-12 22:00:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:00:17,671 INFO L225 Difference]: With dead ends: 8109 [2024-10-12 22:00:17,671 INFO L226 Difference]: Without dead ends: 6833 [2024-10-12 22:00:17,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:00:17,675 INFO L432 NwaCegarLoop]: 1841 mSDtfsCounter, 687 mSDsluCounter, 6688 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 8529 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:00:17,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 8529 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:00:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2024-10-12 22:00:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 6184. [2024-10-12 22:00:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 6017 states have (on average 1.4136612930031578) internal successors, (8506), 6017 states have internal predecessors, (8506), 165 states have call successors, (165), 1 states have call predecessors, (165), 1 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-12 22:00:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 8836 transitions. [2024-10-12 22:00:17,768 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 8836 transitions. Word has length 674 [2024-10-12 22:00:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:00:17,769 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 8836 transitions. [2024-10-12 22:00:17,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 22:00:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 8836 transitions. [2024-10-12 22:00:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2024-10-12 22:00:17,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:00:17,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:00:17,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 22:00:17,778 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:00:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:00:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1283148278, now seen corresponding path program 1 times [2024-10-12 22:00:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:00:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150269588] [2024-10-12 22:00:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:00:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:00:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:00:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 22:00:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 22:00:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 22:00:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 22:00:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 22:00:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 22:00:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-10-12 22:00:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-10-12 22:00:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-10-12 22:00:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-10-12 22:00:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 525 [2024-10-12 22:00:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 537 [2024-10-12 22:00:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-10-12 22:00:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:00:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-12 22:00:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:00:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150269588] [2024-10-12 22:00:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150269588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:00:22,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:00:22,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:00:22,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435835395] [2024-10-12 22:00:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:00:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:00:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:00:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:00:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:00:22,187 INFO L87 Difference]: Start difference. First operand 6184 states and 8836 transitions. Second operand has 7 states, 7 states have (on average 64.85714285714286) internal successors, (454), 7 states have internal predecessors, (454), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)