./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.circular_pointer_top_w8_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 892a8506f942e825df8a32caf9cdaec45fd7cb5b4dbda5bc8acf67b64cc58b84 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:57:58,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:57:58,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:57:58,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:57:58,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:57:58,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:57:58,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:57:58,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:57:58,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:57:58,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:57:58,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:57:58,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:57:58,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:57:58,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:57:58,395 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:57:58,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:57:58,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:57:58,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:57:58,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:57:58,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:57:58,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:57:58,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:57:58,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:57:58,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:57:58,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:57:58,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:57:58,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:57:58,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:57:58,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:57:58,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:57:58,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:57:58,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:57:58,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:57:58,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:57:58,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:57:58,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:57:58,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:57:58,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:57:58,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:57:58,405 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 892a8506f942e825df8a32caf9cdaec45fd7cb5b4dbda5bc8acf67b64cc58b84 [2024-10-11 05:57:58,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:57:58,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:57:58,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:57:58,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:57:58,601 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:57:58,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2024-10-11 05:57:59,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:58:00,113 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:58:00,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2024-10-11 05:58:00,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8171341f4/e19febab323045be91183a5c72438273/FLAGa797c7c64 [2024-10-11 05:58:00,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8171341f4/e19febab323045be91183a5c72438273 [2024-10-11 05:58:00,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:58:00,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:58:00,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:58:00,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:58:00,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:58:00,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:58:00" (1/1) ... [2024-10-11 05:58:00,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20dee7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:00, skipping insertion in model container [2024-10-11 05:58:00,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:58:00" (1/1) ... [2024-10-11 05:58:00,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:58:00,690 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.circular_pointer_top_w8_d8_e0.c[1278,1291] [2024-10-11 05:58:00,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:58:00,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:58:00,830 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.circular_pointer_top_w8_d8_e0.c[1278,1291] [2024-10-11 05:58:01,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:58:01,026 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:58:01,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01 WrapperNode [2024-10-11 05:58:01,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:58:01,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:58:01,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:58:01,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:58:01,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,205 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-10-11 05:58:01,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:58:01,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:58:01,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:58:01,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:58:01,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:58:01,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:58:01,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:58:01,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:58:01,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:58:01,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (1/1) ... [2024-10-11 05:58:01,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:58:01,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:58:01,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:58:01,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:58:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:58:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 05:58:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 05:58:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:58:01,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:58:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:58:01,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:58:01,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:58:02,835 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-11 05:58:02,835 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:58:02,879 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:58:02,881 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:58:02,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:58:02 BoogieIcfgContainer [2024-10-11 05:58:02,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:58:02,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:58:02,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:58:02,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:58:02,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:58:00" (1/3) ... [2024-10-11 05:58:02,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19927878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:58:02, skipping insertion in model container [2024-10-11 05:58:02,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:01" (2/3) ... [2024-10-11 05:58:02,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19927878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:58:02, skipping insertion in model container [2024-10-11 05:58:02,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:58:02" (3/3) ... [2024-10-11 05:58:02,890 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2024-10-11 05:58:02,904 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:58:02,904 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:58:02,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:58:02,984 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;@6a3b317c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:58:02,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:58:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 05:58:03,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:03,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:03,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:03,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1358744025, now seen corresponding path program 1 times [2024-10-11 05:58:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916062403] [2024-10-11 05:58:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:03,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916062403] [2024-10-11 05:58:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916062403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:03,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:03,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 05:58:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365588310] [2024-10-11 05:58:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:03,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 05:58:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 05:58:03,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:58:03,425 INFO L87 Difference]: Start difference. First operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:58:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:03,490 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2024-10-11 05:58:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 05:58:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2024-10-11 05:58:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:03,507 INFO L225 Difference]: With dead ends: 708 [2024-10-11 05:58:03,507 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 05:58:03,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:58:03,517 INFO L432 NwaCegarLoop]: 575 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, 575 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:03,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 05:58:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-11 05:58:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2024-10-11 05:58:03,583 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2024-10-11 05:58:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:03,584 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2024-10-11 05:58:03,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:58:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2024-10-11 05:58:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 05:58:03,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:03,588 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:58:03,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1080158561, now seen corresponding path program 1 times [2024-10-11 05:58:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798530023] [2024-10-11 05:58:03,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:04,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798530023] [2024-10-11 05:58:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798530023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:04,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432759352] [2024-10-11 05:58:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:04,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:04,318 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:04,380 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2024-10-11 05:58:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2024-10-11 05:58:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:04,386 INFO L225 Difference]: With dead ends: 392 [2024-10-11 05:58:04,386 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 05:58:04,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:04,387 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:04,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 05:58:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-11 05:58:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-10-11 05:58:04,410 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2024-10-11 05:58:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:04,412 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-10-11 05:58:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-10-11 05:58:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 05:58:04,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:04,417 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:04,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:58:04,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:04,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:04,418 INFO L85 PathProgramCache]: Analyzing trace with hash -873127207, now seen corresponding path program 1 times [2024-10-11 05:58:04,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:04,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940514651] [2024-10-11 05:58:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940514651] [2024-10-11 05:58:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940514651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:04,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249208671] [2024-10-11 05:58:04,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:04,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:04,831 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:05,202 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2024-10-11 05:58:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:05,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2024-10-11 05:58:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:05,206 INFO L225 Difference]: With dead ends: 970 [2024-10-11 05:58:05,206 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 05:58:05,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:58:05,209 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1090 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:05,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1682 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:58:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 05:58:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-11 05:58:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2024-10-11 05:58:05,231 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2024-10-11 05:58:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:05,232 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2024-10-11 05:58:05,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2024-10-11 05:58:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 05:58:05,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:05,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:05,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:58:05,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:05,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 52997019, now seen corresponding path program 1 times [2024-10-11 05:58:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:05,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193686531] [2024-10-11 05:58:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193686531] [2024-10-11 05:58:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193686531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:05,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25899150] [2024-10-11 05:58:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:05,598 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:05,626 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2024-10-11 05:58:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:05,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-10-11 05:58:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:05,629 INFO L225 Difference]: With dead ends: 713 [2024-10-11 05:58:05,630 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:05,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:05,632 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:05,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1708 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-10-11 05:58:05,645 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2024-10-11 05:58:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:05,646 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-10-11 05:58:05,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-10-11 05:58:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 05:58:05,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:05,649 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:05,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:58:05,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:05,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 544942264, now seen corresponding path program 1 times [2024-10-11 05:58:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115795266] [2024-10-11 05:58:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:05,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115795266] [2024-10-11 05:58:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115795266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785992685] [2024-10-11 05:58:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:06,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:06,005 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:06,059 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2024-10-11 05:58:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-10-11 05:58:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:06,061 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:06,061 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:06,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:06,063 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 487 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:06,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1106 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2024-10-11 05:58:06,075 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 119 [2024-10-11 05:58:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:06,075 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2024-10-11 05:58:06,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2024-10-11 05:58:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:58:06,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:06,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:06,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:58:06,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash 365235381, now seen corresponding path program 1 times [2024-10-11 05:58:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154328256] [2024-10-11 05:58:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154328256] [2024-10-11 05:58:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154328256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:06,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942934830] [2024-10-11 05:58:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:06,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:06,318 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:06,374 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2024-10-11 05:58:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:06,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2024-10-11 05:58:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:06,376 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:06,376 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:06,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:06,377 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 1041 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:06,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1106 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2024-10-11 05:58:06,385 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2024-10-11 05:58:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:06,386 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2024-10-11 05:58:06,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2024-10-11 05:58:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:58:06,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:06,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:06,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:58:06,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:06,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 464765391, now seen corresponding path program 1 times [2024-10-11 05:58:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050559037] [2024-10-11 05:58:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050559037] [2024-10-11 05:58:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050559037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:06,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605316253] [2024-10-11 05:58:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:06,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:06,761 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:06,955 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2024-10-11 05:58:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-10-11 05:58:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:06,960 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:06,960 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:06,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:06,961 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 472 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:06,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1060 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:58:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2024-10-11 05:58:06,977 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2024-10-11 05:58:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:06,977 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2024-10-11 05:58:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2024-10-11 05:58:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 05:58:06,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:06,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:58:06,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 351446361, now seen corresponding path program 1 times [2024-10-11 05:58:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401602502] [2024-10-11 05:58:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401602502] [2024-10-11 05:58:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401602502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496472468] [2024-10-11 05:58:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:07,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:07,433 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:07,616 INFO L93 Difference]: Finished difference Result 721 states and 1055 transitions. [2024-10-11 05:58:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:58:07,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-10-11 05:58:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:07,618 INFO L225 Difference]: With dead ends: 721 [2024-10-11 05:58:07,621 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:07,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:58:07,622 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 483 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:07,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1656 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2024-10-11 05:58:07,638 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2024-10-11 05:58:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:07,639 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2024-10-11 05:58:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2024-10-11 05:58:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 05:58:07,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:07,644 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:58:07,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1265185510, now seen corresponding path program 1 times [2024-10-11 05:58:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058883764] [2024-10-11 05:58:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058883764] [2024-10-11 05:58:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058883764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:07,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872928721] [2024-10-11 05:58:07,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:07,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:07,944 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:08,026 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2024-10-11 05:58:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-10-11 05:58:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:08,028 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:08,028 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:08,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:08,029 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 1030 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:08,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1060 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2024-10-11 05:58:08,036 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2024-10-11 05:58:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:08,036 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2024-10-11 05:58:08,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2024-10-11 05:58:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 05:58:08,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:08,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:08,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:58:08,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -974779296, now seen corresponding path program 1 times [2024-10-11 05:58:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3859863] [2024-10-11 05:58:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:08,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:08,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3859863] [2024-10-11 05:58:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3859863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:08,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:08,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216205095] [2024-10-11 05:58:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:08,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:08,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:08,337 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:08,430 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2024-10-11 05:58:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2024-10-11 05:58:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:08,433 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:08,433 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:08,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:08,435 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 1022 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:08,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1060 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2024-10-11 05:58:08,445 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2024-10-11 05:58:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:08,445 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2024-10-11 05:58:08,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2024-10-11 05:58:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 05:58:08,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:08,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:08,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:58:08,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:08,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2109321857, now seen corresponding path program 1 times [2024-10-11 05:58:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152388490] [2024-10-11 05:58:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:58:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:58:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152388490] [2024-10-11 05:58:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152388490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594605896] [2024-10-11 05:58:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:08,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:08,790 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:58:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:08,844 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2024-10-11 05:58:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:08,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2024-10-11 05:58:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:08,846 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:08,846 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:08,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:08,847 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 518 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:08,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1104 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2024-10-11 05:58:08,856 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2024-10-11 05:58:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:08,856 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2024-10-11 05:58:08,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:58:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2024-10-11 05:58:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 05:58:08,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:08,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:08,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:58:08,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:08,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash -53076295, now seen corresponding path program 1 times [2024-10-11 05:58:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599367101] [2024-10-11 05:58:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:58:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:58:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599367101] [2024-10-11 05:58:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599367101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427063001] [2024-10-11 05:58:09,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:09,289 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:09,411 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2024-10-11 05:58:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2024-10-11 05:58:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:09,414 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:09,414 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:09,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:09,415 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 472 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:09,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1582 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2024-10-11 05:58:09,423 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2024-10-11 05:58:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:09,423 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2024-10-11 05:58:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2024-10-11 05:58:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 05:58:09,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:09,425 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:09,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:58:09,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:09,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1622003115, now seen corresponding path program 1 times [2024-10-11 05:58:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:09,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117731864] [2024-10-11 05:58:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:09,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:58:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:58:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117731864] [2024-10-11 05:58:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117731864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291202774] [2024-10-11 05:58:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:09,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:09,773 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:09,867 INFO L93 Difference]: Finished difference Result 715 states and 1037 transitions. [2024-10-11 05:58:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2024-10-11 05:58:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:09,869 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:09,869 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:09,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:09,871 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 934 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:09,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1058 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2024-10-11 05:58:09,880 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2024-10-11 05:58:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:09,881 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2024-10-11 05:58:09,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2024-10-11 05:58:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 05:58:09,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:09,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:09,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:58:09,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:09,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1431632518, now seen corresponding path program 1 times [2024-10-11 05:58:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:09,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888851503] [2024-10-11 05:58:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:58:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:58:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888851503] [2024-10-11 05:58:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888851503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:10,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:10,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053674975] [2024-10-11 05:58:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:10,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:10,262 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:10,406 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2024-10-11 05:58:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2024-10-11 05:58:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:10,408 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:10,408 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:10,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:10,409 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 928 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:10,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1058 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2024-10-11 05:58:10,418 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2024-10-11 05:58:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2024-10-11 05:58:10,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2024-10-11 05:58:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 05:58:10,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:10,420 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:10,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:58:10,420 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:10,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 596735658, now seen corresponding path program 1 times [2024-10-11 05:58:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:10,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428880645] [2024-10-11 05:58:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:58:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:58:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428880645] [2024-10-11 05:58:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428880645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774097497] [2024-10-11 05:58:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:10,675 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:58:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:10,766 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2024-10-11 05:58:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:10,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 130 [2024-10-11 05:58:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:10,768 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:58:10,768 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:58:10,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:10,769 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 513 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:10,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1098 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:58:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:58:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2024-10-11 05:58:10,779 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2024-10-11 05:58:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2024-10-11 05:58:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:58:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2024-10-11 05:58:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:58:10,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:10,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:58:10,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:10,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1259931877, now seen corresponding path program 1 times [2024-10-11 05:58:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911932148] [2024-10-11 05:58:10,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:10,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:11,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:11,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:11,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911932148] [2024-10-11 05:58:11,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911932148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:11,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328467075] [2024-10-11 05:58:11,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:11,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:11,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:11,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:11,246 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:11,409 INFO L93 Difference]: Finished difference Result 721 states and 1039 transitions. [2024-10-11 05:58:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:58:11,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-10-11 05:58:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:11,411 INFO L225 Difference]: With dead ends: 721 [2024-10-11 05:58:11,412 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 05:58:11,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:11,412 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:11,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2074 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 05:58:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2024-10-11 05:58:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4473007712082262) internal successors, (563), 389 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:58:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 569 transitions. [2024-10-11 05:58:11,421 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 569 transitions. Word has length 131 [2024-10-11 05:58:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:11,421 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 569 transitions. [2024-10-11 05:58:11,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 569 transitions. [2024-10-11 05:58:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 05:58:11,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:11,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:58:11,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:58:11,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:11,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1011320282, now seen corresponding path program 1 times [2024-10-11 05:58:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144618371] [2024-10-11 05:58:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:11,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:58:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144618371] [2024-10-11 05:58:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144618371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:12,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:12,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:58:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716928459] [2024-10-11 05:58:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:12,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:12,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:12,125 INFO L87 Difference]: Start difference. First operand 394 states and 569 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:12,219 INFO L93 Difference]: Finished difference Result 841 states and 1204 transitions. [2024-10-11 05:58:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:12,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2024-10-11 05:58:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:12,221 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:12,221 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:12,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:58:12,222 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 862 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:12,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 2196 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4271653543307086) internal successors, (725), 508 states have internal predecessors, (725), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 737 transitions. [2024-10-11 05:58:12,235 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 737 transitions. Word has length 132 [2024-10-11 05:58:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:12,236 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 737 transitions. [2024-10-11 05:58:12,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 737 transitions. [2024-10-11 05:58:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-10-11 05:58:12,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:12,239 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:12,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:58:12,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:12,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1187992133, now seen corresponding path program 1 times [2024-10-11 05:58:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635910015] [2024-10-11 05:58:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 05:58:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 05:58:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 05:58:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:12,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635910015] [2024-10-11 05:58:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635910015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:12,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636524324] [2024-10-11 05:58:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:12,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:12,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:12,797 INFO L87 Difference]: Start difference. First operand 516 states and 737 transitions. Second operand has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:12,873 INFO L93 Difference]: Finished difference Result 841 states and 1203 transitions. [2024-10-11 05:58:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 319 [2024-10-11 05:58:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:12,875 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:12,875 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:12,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:12,877 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 941 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:12,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1056 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4251968503937007) internal successors, (724), 508 states have internal predecessors, (724), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 736 transitions. [2024-10-11 05:58:12,891 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 736 transitions. Word has length 319 [2024-10-11 05:58:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:12,891 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 736 transitions. [2024-10-11 05:58:12,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 736 transitions. [2024-10-11 05:58:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-11 05:58:12,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:12,894 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:12,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:58:12,894 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1135548299, now seen corresponding path program 1 times [2024-10-11 05:58:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207516060] [2024-10-11 05:58:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 05:58:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 05:58:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-11 05:58:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207516060] [2024-10-11 05:58:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207516060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145884574] [2024-10-11 05:58:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:13,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:13,400 INFO L87 Difference]: Start difference. First operand 516 states and 736 transitions. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:13,479 INFO L93 Difference]: Finished difference Result 841 states and 1201 transitions. [2024-10-11 05:58:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:13,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 320 [2024-10-11 05:58:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:13,481 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:13,481 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:13,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:13,483 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 508 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:13,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1062 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4232283464566928) internal successors, (723), 508 states have internal predecessors, (723), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 735 transitions. [2024-10-11 05:58:13,496 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 735 transitions. Word has length 320 [2024-10-11 05:58:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:13,496 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 735 transitions. [2024-10-11 05:58:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 735 transitions. [2024-10-11 05:58:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-11 05:58:13,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:13,500 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:13,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:58:13,500 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:13,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1129439920, now seen corresponding path program 1 times [2024-10-11 05:58:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238679743] [2024-10-11 05:58:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:58:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 05:58:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 05:58:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238679743] [2024-10-11 05:58:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238679743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:14,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917049100] [2024-10-11 05:58:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:14,026 INFO L87 Difference]: Start difference. First operand 516 states and 735 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:14,098 INFO L93 Difference]: Finished difference Result 841 states and 1199 transitions. [2024-10-11 05:58:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:14,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321 [2024-10-11 05:58:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:14,102 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:14,102 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:14,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:14,103 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 500 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:14,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1062 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.421259842519685) internal successors, (722), 508 states have internal predecessors, (722), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2024-10-11 05:58:14,116 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 321 [2024-10-11 05:58:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:14,116 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2024-10-11 05:58:14,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2024-10-11 05:58:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-11 05:58:14,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:14,119 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:14,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:58:14,119 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:14,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash -606357174, now seen corresponding path program 1 times [2024-10-11 05:58:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822808685] [2024-10-11 05:58:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 05:58:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-11 05:58:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 05:58:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:14,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822808685] [2024-10-11 05:58:14,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822808685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:14,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:14,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235455248] [2024-10-11 05:58:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:14,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:14,659 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:14,737 INFO L93 Difference]: Finished difference Result 841 states and 1197 transitions. [2024-10-11 05:58:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322 [2024-10-11 05:58:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:14,740 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:14,740 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:14,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:14,741 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 893 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:14,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1056 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.419291338582677) internal successors, (721), 508 states have internal predecessors, (721), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 733 transitions. [2024-10-11 05:58:14,755 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 733 transitions. Word has length 322 [2024-10-11 05:58:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:14,755 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 733 transitions. [2024-10-11 05:58:14,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 733 transitions. [2024-10-11 05:58:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-11 05:58:14,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:14,759 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:14,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:58:14,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:14,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -941245659, now seen corresponding path program 1 times [2024-10-11 05:58:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307030705] [2024-10-11 05:58:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-11 05:58:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 05:58:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-11 05:58:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:15,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:15,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307030705] [2024-10-11 05:58:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307030705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241052432] [2024-10-11 05:58:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:15,418 INFO L87 Difference]: Start difference. First operand 516 states and 733 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:15,511 INFO L93 Difference]: Finished difference Result 841 states and 1195 transitions. [2024-10-11 05:58:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2024-10-11 05:58:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:15,514 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:15,514 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:15,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:15,515 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 870 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:15,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1080 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4173228346456692) internal successors, (720), 508 states have internal predecessors, (720), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 732 transitions. [2024-10-11 05:58:15,529 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 732 transitions. Word has length 323 [2024-10-11 05:58:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:15,530 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 732 transitions. [2024-10-11 05:58:15,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 732 transitions. [2024-10-11 05:58:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-11 05:58:15,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:15,534 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:58:15,535 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:15,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash -199604833, now seen corresponding path program 1 times [2024-10-11 05:58:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088069487] [2024-10-11 05:58:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-11 05:58:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-11 05:58:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-11 05:58:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088069487] [2024-10-11 05:58:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088069487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712797795] [2024-10-11 05:58:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:16,669 INFO L87 Difference]: Start difference. First operand 516 states and 732 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:16,756 INFO L93 Difference]: Finished difference Result 841 states and 1193 transitions. [2024-10-11 05:58:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-10-11 05:58:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:16,758 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:16,758 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:16,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:16,759 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 469 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:16,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1086 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4153543307086613) internal successors, (719), 508 states have internal predecessors, (719), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 731 transitions. [2024-10-11 05:58:16,769 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 731 transitions. Word has length 324 [2024-10-11 05:58:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:16,769 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 731 transitions. [2024-10-11 05:58:16,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 731 transitions. [2024-10-11 05:58:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-11 05:58:16,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:16,772 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:16,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:58:16,772 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:16,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash -756123878, now seen corresponding path program 1 times [2024-10-11 05:58:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:16,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147148770] [2024-10-11 05:58:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:16,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-11 05:58:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-11 05:58:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 05:58:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147148770] [2024-10-11 05:58:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147148770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674604515] [2024-10-11 05:58:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:17,445 INFO L87 Difference]: Start difference. First operand 516 states and 731 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:17,694 INFO L93 Difference]: Finished difference Result 841 states and 1191 transitions. [2024-10-11 05:58:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-10-11 05:58:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:17,697 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:17,697 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:17,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:17,698 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 832 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:17,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 800 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:58:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4133858267716535) internal successors, (718), 508 states have internal predecessors, (718), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2024-10-11 05:58:17,711 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 325 [2024-10-11 05:58:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:17,712 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2024-10-11 05:58:17,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2024-10-11 05:58:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-11 05:58:17,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:17,715 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:17,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:58:17,715 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:17,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1451176588, now seen corresponding path program 1 times [2024-10-11 05:58:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:17,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260778] [2024-10-11 05:58:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-11 05:58:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:58:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-11 05:58:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260778] [2024-10-11 05:58:18,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393833371] [2024-10-11 05:58:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:18,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:18,964 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:19,011 INFO L93 Difference]: Finished difference Result 841 states and 1189 transitions. [2024-10-11 05:58:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:19,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-10-11 05:58:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:19,017 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:19,017 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:19,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:19,018 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 384 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:19,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1078 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4114173228346456) internal successors, (717), 508 states have internal predecessors, (717), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 729 transitions. [2024-10-11 05:58:19,029 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 729 transitions. Word has length 326 [2024-10-11 05:58:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:19,029 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 729 transitions. [2024-10-11 05:58:19,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 729 transitions. [2024-10-11 05:58:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-11 05:58:19,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:19,031 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:19,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:58:19,032 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:19,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1379835252, now seen corresponding path program 1 times [2024-10-11 05:58:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281761856] [2024-10-11 05:58:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 05:58:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:58:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:58:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:19,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:19,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281761856] [2024-10-11 05:58:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281761856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:19,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:19,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:19,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071710918] [2024-10-11 05:58:19,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:19,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:19,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:19,895 INFO L87 Difference]: Start difference. First operand 516 states and 729 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:19,977 INFO L93 Difference]: Finished difference Result 841 states and 1187 transitions. [2024-10-11 05:58:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-10-11 05:58:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:19,981 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:19,981 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:19,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:19,982 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 866 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:19,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1048 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4094488188976377) internal successors, (716), 508 states have internal predecessors, (716), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 728 transitions. [2024-10-11 05:58:19,996 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 728 transitions. Word has length 327 [2024-10-11 05:58:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:19,997 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 728 transitions. [2024-10-11 05:58:19,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 728 transitions. [2024-10-11 05:58:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-11 05:58:19,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:19,999 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:58:19,999 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 523748020, now seen corresponding path program 1 times [2024-10-11 05:58:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683295854] [2024-10-11 05:58:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-11 05:58:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:58:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 05:58:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:21,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:21,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683295854] [2024-10-11 05:58:21,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683295854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:21,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:21,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:21,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892597659] [2024-10-11 05:58:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:21,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:21,042 INFO L87 Difference]: Start difference. First operand 516 states and 728 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:21,129 INFO L93 Difference]: Finished difference Result 841 states and 1185 transitions. [2024-10-11 05:58:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:21,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-10-11 05:58:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:21,131 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:21,131 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:21,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:21,132 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 856 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:21,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1048 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4074803149606299) internal successors, (715), 508 states have internal predecessors, (715), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2024-10-11 05:58:21,147 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 328 [2024-10-11 05:58:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:21,148 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2024-10-11 05:58:21,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2024-10-11 05:58:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-11 05:58:21,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:21,151 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:58:21,151 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1019542245, now seen corresponding path program 1 times [2024-10-11 05:58:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853442079] [2024-10-11 05:58:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-11 05:58:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 05:58:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 05:58:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853442079] [2024-10-11 05:58:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853442079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:58:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421254427] [2024-10-11 05:58:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:22,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:58:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:58:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:58:22,064 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:22,127 INFO L93 Difference]: Finished difference Result 841 states and 1183 transitions. [2024-10-11 05:58:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:58:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-10-11 05:58:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:22,129 INFO L225 Difference]: With dead ends: 841 [2024-10-11 05:58:22,129 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:58:22,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:22,129 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 393 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:22,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1048 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:58:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-11 05:58:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.405511811023622) internal successors, (714), 508 states have internal predecessors, (714), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 726 transitions. [2024-10-11 05:58:22,146 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 726 transitions. Word has length 329 [2024-10-11 05:58:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:22,147 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 726 transitions. [2024-10-11 05:58:22,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 726 transitions. [2024-10-11 05:58:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-11 05:58:22,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:22,148 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:22,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:58:22,149 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash -104594203, now seen corresponding path program 1 times [2024-10-11 05:58:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299614037] [2024-10-11 05:58:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-11 05:58:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 05:58:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:58:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-11 05:58:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299614037] [2024-10-11 05:58:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299614037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827223345] [2024-10-11 05:58:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:23,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:23,490 INFO L87 Difference]: Start difference. First operand 516 states and 726 transitions. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:23,802 INFO L93 Difference]: Finished difference Result 883 states and 1232 transitions. [2024-10-11 05:58:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:58:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-10-11 05:58:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:23,805 INFO L225 Difference]: With dead ends: 883 [2024-10-11 05:58:23,805 INFO L226 Difference]: Without dead ends: 520 [2024-10-11 05:58:23,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:23,809 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 469 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:23,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1200 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:58:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-11 05:58:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2024-10-11 05:58:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 510 states have (on average 1.4039215686274509) internal successors, (716), 510 states have internal predecessors, (716), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 728 transitions. [2024-10-11 05:58:23,823 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 728 transitions. Word has length 330 [2024-10-11 05:58:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:23,823 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 728 transitions. [2024-10-11 05:58:23,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 728 transitions. [2024-10-11 05:58:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-11 05:58:23,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:23,825 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:23,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 05:58:23,826 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:23,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:23,826 INFO L85 PathProgramCache]: Analyzing trace with hash -638964905, now seen corresponding path program 1 times [2024-10-11 05:58:23,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:23,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582937581] [2024-10-11 05:58:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:23,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-11 05:58:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 05:58:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:58:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-11 05:58:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:25,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582937581] [2024-10-11 05:58:25,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582937581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:25,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:25,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:58:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915588384] [2024-10-11 05:58:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:25,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:25,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:25,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:25,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:25,112 INFO L87 Difference]: Start difference. First operand 518 states and 728 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:58:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:25,411 INFO L93 Difference]: Finished difference Result 886 states and 1233 transitions. [2024-10-11 05:58:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:25,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 330 [2024-10-11 05:58:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:25,418 INFO L225 Difference]: With dead ends: 886 [2024-10-11 05:58:25,418 INFO L226 Difference]: Without dead ends: 520 [2024-10-11 05:58:25,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:58:25,419 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 511 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:25,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1987 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:58:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-11 05:58:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2024-10-11 05:58:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 510 states have (on average 1.4) internal successors, (714), 510 states have internal predecessors, (714), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:58:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 726 transitions. [2024-10-11 05:58:25,433 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 726 transitions. Word has length 330 [2024-10-11 05:58:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:25,434 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 726 transitions. [2024-10-11 05:58:25,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:58:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 726 transitions. [2024-10-11 05:58:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-11 05:58:25,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:25,435 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:25,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:58:25,436 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1165516689, now seen corresponding path program 1 times [2024-10-11 05:58:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:25,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202274507] [2024-10-11 05:58:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:58:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 05:58:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-11 05:58:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:26,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202274507] [2024-10-11 05:58:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202274507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:26,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:58:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840716805] [2024-10-11 05:58:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:26,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:26,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:26,272 INFO L87 Difference]: Start difference. First operand 518 states and 726 transitions. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:26,875 INFO L93 Difference]: Finished difference Result 1234 states and 1731 transitions. [2024-10-11 05:58:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-10-11 05:58:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:26,879 INFO L225 Difference]: With dead ends: 1234 [2024-10-11 05:58:26,879 INFO L226 Difference]: Without dead ends: 908 [2024-10-11 05:58:26,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-11 05:58:26,880 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 349 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:26,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 2515 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:58:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-11 05:58:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 800. [2024-10-11 05:58:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 789 states have (on average 1.394169835234474) internal successors, (1100), 789 states have internal predecessors, (1100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:58:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1118 transitions. [2024-10-11 05:58:26,896 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1118 transitions. Word has length 332 [2024-10-11 05:58:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1118 transitions. [2024-10-11 05:58:26,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1118 transitions. [2024-10-11 05:58:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-11 05:58:26,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:26,899 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:26,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:58:26,899 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:26,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 854544943, now seen corresponding path program 1 times [2024-10-11 05:58:26,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:26,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545238780] [2024-10-11 05:58:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 05:58:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-11 05:58:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:58:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 05:58:28,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:28,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545238780] [2024-10-11 05:58:28,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545238780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:28,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:28,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313737599] [2024-10-11 05:58:28,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:28,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:28,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:28,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:28,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:28,241 INFO L87 Difference]: Start difference. First operand 800 states and 1118 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:28,278 INFO L93 Difference]: Finished difference Result 1409 states and 1941 transitions. [2024-10-11 05:58:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:58:28,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-10-11 05:58:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:28,281 INFO L225 Difference]: With dead ends: 1409 [2024-10-11 05:58:28,281 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 05:58:28,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:28,282 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 17 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:28,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2170 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 05:58:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 935. [2024-10-11 05:58:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3625541125541125) internal successors, (1259), 924 states have internal predecessors, (1259), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:58:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1277 transitions. [2024-10-11 05:58:28,299 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1277 transitions. Word has length 333 [2024-10-11 05:58:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:28,299 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1277 transitions. [2024-10-11 05:58:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1277 transitions. [2024-10-11 05:58:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-11 05:58:28,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:28,302 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:28,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 05:58:28,302 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:28,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -101311359, now seen corresponding path program 1 times [2024-10-11 05:58:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838162993] [2024-10-11 05:58:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 05:58:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 05:58:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:58:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838162993] [2024-10-11 05:58:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838162993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:58:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024479208] [2024-10-11 05:58:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:29,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:29,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:29,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:29,300 INFO L87 Difference]: Start difference. First operand 935 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:29,757 INFO L93 Difference]: Finished difference Result 1329 states and 1819 transitions. [2024-10-11 05:58:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:29,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-10-11 05:58:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:29,761 INFO L225 Difference]: With dead ends: 1329 [2024-10-11 05:58:29,761 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 05:58:29,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:58:29,762 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1010 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:29,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1559 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:58:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 05:58:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 936. [2024-10-11 05:58:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3621621621621622) internal successors, (1260), 925 states have internal predecessors, (1260), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:58:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1278 transitions. [2024-10-11 05:58:29,778 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1278 transitions. Word has length 335 [2024-10-11 05:58:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:29,779 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1278 transitions. [2024-10-11 05:58:29,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1278 transitions. [2024-10-11 05:58:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-11 05:58:29,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:29,781 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 05:58:29,781 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:29,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1966033512, now seen corresponding path program 1 times [2024-10-11 05:58:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300274520] [2024-10-11 05:58:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:58:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:58:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:58:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 05:58:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 05:58:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:58:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 05:58:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300274520] [2024-10-11 05:58:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300274520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:30,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:58:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517008060] [2024-10-11 05:58:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:58:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:58:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:58:30,949 INFO L87 Difference]: Start difference. First operand 936 states and 1278 transitions. Second operand has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:31,088 INFO L93 Difference]: Finished difference Result 2113 states and 2876 transitions. [2024-10-11 05:58:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:58:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-10-11 05:58:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:31,093 INFO L225 Difference]: With dead ends: 2113 [2024-10-11 05:58:31,093 INFO L226 Difference]: Without dead ends: 1624 [2024-10-11 05:58:31,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:58:31,094 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 822 mSDsluCounter, 5521 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 6807 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:31,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 6807 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:58:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-10-11 05:58:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1003. [2024-10-11 05:58:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 989 states have (on average 1.366026289180991) internal successors, (1351), 989 states have internal predecessors, (1351), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:58:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1375 transitions. [2024-10-11 05:58:31,118 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1375 transitions. Word has length 335 [2024-10-11 05:58:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:31,118 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1375 transitions. [2024-10-11 05:58:31,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1375 transitions. [2024-10-11 05:58:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-11 05:58:31,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:31,122 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 05:58:31,123 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 541248472, now seen corresponding path program 1 times [2024-10-11 05:58:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602287550] [2024-10-11 05:58:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:58:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:58:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:58:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 05:58:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 05:58:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 05:58:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-11 05:58:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602287550] [2024-10-11 05:58:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602287550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:32,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:58:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792008375] [2024-10-11 05:58:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:58:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:58:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:58:32,071 INFO L87 Difference]: Start difference. First operand 1003 states and 1375 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:32,316 INFO L93 Difference]: Finished difference Result 2131 states and 2918 transitions. [2024-10-11 05:58:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:58:32,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-10-11 05:58:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:32,320 INFO L225 Difference]: With dead ends: 2131 [2024-10-11 05:58:32,320 INFO L226 Difference]: Without dead ends: 1019 [2024-10-11 05:58:32,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 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-11 05:58:32,322 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 630 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:32,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2501 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:58:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-11 05:58:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1011. [2024-10-11 05:58:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 997 states have (on average 1.3590772316950852) internal successors, (1355), 997 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:58:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1379 transitions. [2024-10-11 05:58:32,343 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1379 transitions. Word has length 336 [2024-10-11 05:58:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:32,344 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1379 transitions. [2024-10-11 05:58:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1379 transitions. [2024-10-11 05:58:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-11 05:58:32,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:32,346 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:32,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 05:58:32,347 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:32,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1114654100, now seen corresponding path program 1 times [2024-10-11 05:58:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:32,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964259116] [2024-10-11 05:58:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:58:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:58:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:58:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 05:58:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-11 05:58:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-11 05:58:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-11 05:58:33,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964259116] [2024-10-11 05:58:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964259116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:33,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:58:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710221452] [2024-10-11 05:58:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:58:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:33,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:58:33,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:58:33,452 INFO L87 Difference]: Start difference. First operand 1011 states and 1379 transitions. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:34,457 INFO L93 Difference]: Finished difference Result 2517 states and 3402 transitions. [2024-10-11 05:58:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:58:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338 [2024-10-11 05:58:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:34,463 INFO L225 Difference]: With dead ends: 2517 [2024-10-11 05:58:34,463 INFO L226 Difference]: Without dead ends: 1877 [2024-10-11 05:58:34,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:58:34,465 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1288 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:34,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2410 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:58:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-11 05:58:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1869. [2024-10-11 05:58:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1843 states have (on average 1.3505154639175259) internal successors, (2489), 1843 states have internal predecessors, (2489), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 05:58:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2537 transitions. [2024-10-11 05:58:34,496 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2537 transitions. Word has length 338 [2024-10-11 05:58:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:34,497 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2537 transitions. [2024-10-11 05:58:34,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:58:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2537 transitions. [2024-10-11 05:58:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-11 05:58:34,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:34,500 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:34,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 05:58:34,501 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:34,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 366505692, now seen corresponding path program 1 times [2024-10-11 05:58:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419670080] [2024-10-11 05:58:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:58:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:58:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:58:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 05:58:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 05:58:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 05:58:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-11 05:58:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419670080] [2024-10-11 05:58:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419670080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:58:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610410561] [2024-10-11 05:58:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:35,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:58:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:58:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:58:35,508 INFO L87 Difference]: Start difference. First operand 1869 states and 2537 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:58:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:36,108 INFO L93 Difference]: Finished difference Result 3532 states and 4783 transitions. [2024-10-11 05:58:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 340 [2024-10-11 05:58:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:36,114 INFO L225 Difference]: With dead ends: 3532 [2024-10-11 05:58:36,114 INFO L226 Difference]: Without dead ends: 1901 [2024-10-11 05:58:36,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:58:36,116 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1035 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:36,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1547 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:58:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-11 05:58:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1885. [2024-10-11 05:58:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1859 states have (on average 1.3431952662721893) internal successors, (2497), 1859 states have internal predecessors, (2497), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 05:58:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2545 transitions. [2024-10-11 05:58:36,151 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2545 transitions. Word has length 340 [2024-10-11 05:58:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:36,151 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2545 transitions. [2024-10-11 05:58:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:58:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2545 transitions. [2024-10-11 05:58:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-11 05:58:36,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:36,155 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:36,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 05:58:36,155 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:36,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1624562388, now seen corresponding path program 1 times [2024-10-11 05:58:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:36,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224579838] [2024-10-11 05:58:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:58:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:58:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:58:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-11 05:58:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:58:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:58:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-11 05:58:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224579838] [2024-10-11 05:58:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224579838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:37,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:37,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:58:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145907340] [2024-10-11 05:58:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:37,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:37,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:37,167 INFO L87 Difference]: Start difference. First operand 1885 states and 2545 transitions. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:58:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:37,565 INFO L93 Difference]: Finished difference Result 3512 states and 4733 transitions. [2024-10-11 05:58:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:37,566 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 342 [2024-10-11 05:58:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:37,573 INFO L225 Difference]: With dead ends: 3512 [2024-10-11 05:58:37,573 INFO L226 Difference]: Without dead ends: 1901 [2024-10-11 05:58:37,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:58:37,576 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 498 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:37,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1547 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:58:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-11 05:58:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1893. [2024-10-11 05:58:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1867 states have (on average 1.3417246920192822) internal successors, (2505), 1867 states have internal predecessors, (2505), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 05:58:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2553 transitions. [2024-10-11 05:58:37,614 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2553 transitions. Word has length 342 [2024-10-11 05:58:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:37,614 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2553 transitions. [2024-10-11 05:58:37,614 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:58:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2553 transitions. [2024-10-11 05:58:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-11 05:58:37,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:37,618 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:37,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 05:58:37,618 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash -526007198, now seen corresponding path program 1 times [2024-10-11 05:58:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037164690] [2024-10-11 05:58:37,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:37,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:58:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:58:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 05:58:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 05:58:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 05:58:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-11 05:58:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-11 05:58:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:38,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037164690] [2024-10-11 05:58:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037164690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:38,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:38,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:58:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419457378] [2024-10-11 05:58:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:38,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:38,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:58:38,545 INFO L87 Difference]: Start difference. First operand 1893 states and 2553 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:38,952 INFO L93 Difference]: Finished difference Result 1903 states and 2561 transitions. [2024-10-11 05:58:38,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 344 [2024-10-11 05:58:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:38,955 INFO L225 Difference]: With dead ends: 1903 [2024-10-11 05:58:38,955 INFO L226 Difference]: Without dead ends: 1031 [2024-10-11 05:58:38,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:58:38,957 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 510 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:38,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1547 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:58:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-11 05:58:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1027. [2024-10-11 05:58:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1013 states have (on average 1.3494570582428431) internal successors, (1367), 1013 states have internal predecessors, (1367), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:58:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1391 transitions. [2024-10-11 05:58:38,973 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1391 transitions. Word has length 344 [2024-10-11 05:58:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1391 transitions. [2024-10-11 05:58:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1391 transitions. [2024-10-11 05:58:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-11 05:58:38,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:38,975 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:38,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 05:58:38,976 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:38,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1627115852, now seen corresponding path program 1 times [2024-10-11 05:58:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:38,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835695471] [2024-10-11 05:58:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:38,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:58:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:58:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:58:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-11 05:58:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:58:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-11 05:58:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835695471] [2024-10-11 05:58:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835695471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:58:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195998106] [2024-10-11 05:58:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:40,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:58:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:58:40,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:58:40,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:58:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:41,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 2043 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 05:58:41,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:58:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 05:58:42,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:58:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 05:58:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195998106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:58:43,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:58:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-10-11 05:58:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565668446] [2024-10-11 05:58:43,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:58:43,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 05:58:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 05:58:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-10-11 05:58:43,413 INFO L87 Difference]: Start difference. First operand 1027 states and 1391 transitions. Second operand has 26 states, 26 states have (on average 32.96153846153846) internal successors, (857), 26 states have internal predecessors, (857), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-11 05:58:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:45,185 INFO L93 Difference]: Finished difference Result 1831 states and 2468 transitions. [2024-10-11 05:58:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 05:58:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 32.96153846153846) internal successors, (857), 26 states have internal predecessors, (857), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 344 [2024-10-11 05:58:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:45,189 INFO L225 Difference]: With dead ends: 1831 [2024-10-11 05:58:45,196 INFO L226 Difference]: Without dead ends: 1051 [2024-10-11 05:58:45,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 05:58:45,198 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1112 mSDsluCounter, 7158 mSDsCounter, 0 mSdLazyCounter, 3726 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 7639 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:45,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 7639 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3726 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:58:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-11 05:58:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1040. [2024-10-11 05:58:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1026 states have (on average 1.3421052631578947) internal successors, (1377), 1026 states have internal predecessors, (1377), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:58:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1401 transitions. [2024-10-11 05:58:45,241 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1401 transitions. Word has length 344 [2024-10-11 05:58:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:45,242 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1401 transitions. [2024-10-11 05:58:45,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.96153846153846) internal successors, (857), 26 states have internal predecessors, (857), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-11 05:58:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1401 transitions. [2024-10-11 05:58:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 05:58:45,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:45,245 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:45,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:58:45,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 05:58:45,447 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1536229955, now seen corresponding path program 1 times [2024-10-11 05:58:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891858925] [2024-10-11 05:58:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:58:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:58:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:58:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:58:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:58:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 05:58:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-11 05:58:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891858925] [2024-10-11 05:58:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891858925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:58:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490357289] [2024-10-11 05:58:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:45,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:58:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:58:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:45,981 INFO L87 Difference]: Start difference. First operand 1040 states and 1401 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:46,014 INFO L93 Difference]: Finished difference Result 1716 states and 2316 transitions. [2024-10-11 05:58:46,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:58:46,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 348 [2024-10-11 05:58:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:46,017 INFO L225 Difference]: With dead ends: 1716 [2024-10-11 05:58:46,017 INFO L226 Difference]: Without dead ends: 1094 [2024-10-11 05:58:46,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:58:46,018 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 16 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:46,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-10-11 05:58:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2024-10-11 05:58:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1080 states have (on average 1.3472222222222223) internal successors, (1455), 1080 states have internal predecessors, (1455), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:58:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1479 transitions. [2024-10-11 05:58:46,039 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1479 transitions. Word has length 348 [2024-10-11 05:58:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:46,039 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1479 transitions. [2024-10-11 05:58:46,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:58:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1479 transitions. [2024-10-11 05:58:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-11 05:58:46,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:46,042 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:46,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 05:58:46,042 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1231735407, now seen corresponding path program 1 times [2024-10-11 05:58:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852210137] [2024-10-11 05:58:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:58:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:58:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:58:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:58:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:58:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 05:58:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 05:58:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852210137] [2024-10-11 05:58:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852210137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:48,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:58:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129610161] [2024-10-11 05:58:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:48,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:58:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:58:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:58:48,154 INFO L87 Difference]: Start difference. First operand 1094 states and 1479 transitions. Second operand has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:58:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:49,212 INFO L93 Difference]: Finished difference Result 2641 states and 3535 transitions. [2024-10-11 05:58:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:58:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-11 05:58:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:49,216 INFO L225 Difference]: With dead ends: 2641 [2024-10-11 05:58:49,217 INFO L226 Difference]: Without dead ends: 1887 [2024-10-11 05:58:49,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:58:49,218 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 882 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:49,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 3272 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:58:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-10-11 05:58:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1240. [2024-10-11 05:58:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1222 states have (on average 1.3494271685761048) internal successors, (1649), 1222 states have internal predecessors, (1649), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 05:58:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1681 transitions. [2024-10-11 05:58:49,241 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1681 transitions. Word has length 349 [2024-10-11 05:58:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:49,241 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1681 transitions. [2024-10-11 05:58:49,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:58:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1681 transitions. [2024-10-11 05:58:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-11 05:58:49,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:49,244 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:49,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 05:58:49,244 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:49,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash 623555153, now seen corresponding path program 1 times [2024-10-11 05:58:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986666391] [2024-10-11 05:58:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:58:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:58:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:58:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:58:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:58:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 05:58:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 50 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:58:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986666391] [2024-10-11 05:58:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986666391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:58:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304151178] [2024-10-11 05:58:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:54,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:58:54,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:58:54,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:58:54,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:58:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:55,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 05:58:55,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:58:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 05:58:55,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:58:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304151178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:55,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:58:55,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 24 [2024-10-11 05:58:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448726084] [2024-10-11 05:58:55,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:55,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:58:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:58:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-11 05:58:55,809 INFO L87 Difference]: Start difference. First operand 1240 states and 1681 transitions. Second operand has 6 states, 5 states have (on average 59.2) internal successors, (296), 6 states have internal predecessors, (296), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:58:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:55,856 INFO L93 Difference]: Finished difference Result 2177 states and 2945 transitions. [2024-10-11 05:58:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:58:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.2) internal successors, (296), 6 states have internal predecessors, (296), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 349 [2024-10-11 05:58:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:55,859 INFO L225 Difference]: With dead ends: 2177 [2024-10-11 05:58:55,859 INFO L226 Difference]: Without dead ends: 1240 [2024-10-11 05:58:55,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-11 05:58:55,861 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:55,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2703 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:58:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2024-10-11 05:58:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2024-10-11 05:58:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1222 states have (on average 1.3428805237315875) internal successors, (1641), 1222 states have internal predecessors, (1641), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 05:58:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1673 transitions. [2024-10-11 05:58:55,881 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1673 transitions. Word has length 349 [2024-10-11 05:58:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:55,881 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1673 transitions. [2024-10-11 05:58:55,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.2) internal successors, (296), 6 states have internal predecessors, (296), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:58:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1673 transitions. [2024-10-11 05:58:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:58:55,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:55,884 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:55,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 05:58:56,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:58:56,085 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:56,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 815693963, now seen corresponding path program 1 times [2024-10-11 05:58:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874067621] [2024-10-11 05:58:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:58:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:58:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:58:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:58:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:58:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 05:58:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:58:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-11 05:58:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:58:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874067621] [2024-10-11 05:58:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874067621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:58:58,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:58:58,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:58:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924910124] [2024-10-11 05:58:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:58:58,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:58:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:58:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:58:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:58:58,452 INFO L87 Difference]: Start difference. First operand 1240 states and 1673 transitions. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:58:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:58:58,797 INFO L93 Difference]: Finished difference Result 2352 states and 3172 transitions. [2024-10-11 05:58:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:58:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351 [2024-10-11 05:58:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:58:58,801 INFO L225 Difference]: With dead ends: 2352 [2024-10-11 05:58:58,801 INFO L226 Difference]: Without dead ends: 1633 [2024-10-11 05:58:58,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:58:58,802 INFO L432 NwaCegarLoop]: 840 mSDtfsCounter, 2293 mSDsluCounter, 4018 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 4858 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:58:58,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 4858 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:58:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-10-11 05:58:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1304. [2024-10-11 05:58:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1283 states have (on average 1.3390491036632892) internal successors, (1718), 1283 states have internal predecessors, (1718), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 05:58:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1756 transitions. [2024-10-11 05:58:58,824 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1756 transitions. Word has length 351 [2024-10-11 05:58:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:58:58,825 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1756 transitions. [2024-10-11 05:58:58,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:58:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1756 transitions. [2024-10-11 05:58:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:58:58,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:58:58,828 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:58:58,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 05:58:58,828 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:58:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:58:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1555587349, now seen corresponding path program 1 times [2024-10-11 05:58:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:58:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086284019] [2024-10-11 05:58:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:58:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:58:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:59:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:59:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:59:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:59:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:59:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 05:59:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:59:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:59:00,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086284019] [2024-10-11 05:59:00,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086284019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:59:00,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:59:00,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:59:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653508564] [2024-10-11 05:59:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:59:00,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:59:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:59:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:59:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:59:00,592 INFO L87 Difference]: Start difference. First operand 1304 states and 1756 transitions. Second operand has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:59:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:59:01,307 INFO L93 Difference]: Finished difference Result 2482 states and 3328 transitions. [2024-10-11 05:59:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:59:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351 [2024-10-11 05:59:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:59:01,310 INFO L225 Difference]: With dead ends: 2482 [2024-10-11 05:59:01,310 INFO L226 Difference]: Without dead ends: 1931 [2024-10-11 05:59:01,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:59:01,311 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 1185 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:59:01,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2750 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:59:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-10-11 05:59:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1697. [2024-10-11 05:59:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1676 states have (on average 1.3204057279236276) internal successors, (2213), 1676 states have internal predecessors, (2213), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 05:59:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2251 transitions. [2024-10-11 05:59:01,335 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2251 transitions. Word has length 351 [2024-10-11 05:59:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:59:01,335 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2251 transitions. [2024-10-11 05:59:01,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:59:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2251 transitions. [2024-10-11 05:59:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:59:01,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:59:01,338 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:59:01,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 05:59:01,338 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:59:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:59:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 885421352, now seen corresponding path program 1 times [2024-10-11 05:59:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:59:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324983350] [2024-10-11 05:59:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:59:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:59:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:59:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:59:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:59:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:59:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 05:59:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:59:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:59:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324983350] [2024-10-11 05:59:07,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324983350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:59:07,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106487137] [2024-10-11 05:59:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:07,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:59:07,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:59:07,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:59:07,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:59:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:08,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 05:59:08,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:59:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-11 05:59:08,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:59:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106487137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:59:08,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:59:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-10-11 05:59:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694482740] [2024-10-11 05:59:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:59:08,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:59:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:59:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:59:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:59:08,426 INFO L87 Difference]: Start difference. First operand 1697 states and 2251 transitions. Second operand has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:59:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:59:08,473 INFO L93 Difference]: Finished difference Result 3115 states and 4119 transitions. [2024-10-11 05:59:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:59:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 351 [2024-10-11 05:59:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:59:08,476 INFO L225 Difference]: With dead ends: 3115 [2024-10-11 05:59:08,476 INFO L226 Difference]: Without dead ends: 1697 [2024-10-11 05:59:08,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:59:08,478 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:59:08,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2698 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:59:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-11 05:59:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2024-10-11 05:59:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1676 states have (on average 1.318019093078759) internal successors, (2209), 1676 states have internal predecessors, (2209), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 05:59:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2247 transitions. [2024-10-11 05:59:08,501 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2247 transitions. Word has length 351 [2024-10-11 05:59:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:59:08,501 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2247 transitions. [2024-10-11 05:59:08,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:59:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2247 transitions. [2024-10-11 05:59:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:59:08,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:59:08,504 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:59:08,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 05:59:08,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:59:08,706 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:59:08,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:59:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1830756417, now seen corresponding path program 1 times [2024-10-11 05:59:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:59:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924419406] [2024-10-11 05:59:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:59:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:59:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 05:59:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:59:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:59:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:59:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 05:59:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:59:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:59:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924419406] [2024-10-11 05:59:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924419406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:59:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:59:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:59:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946405323] [2024-10-11 05:59:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:59:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:59:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:59:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:59:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:59:09,772 INFO L87 Difference]: Start difference. First operand 1697 states and 2247 transitions. Second operand has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:59:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:59:10,305 INFO L93 Difference]: Finished difference Result 2846 states and 3779 transitions. [2024-10-11 05:59:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:59:10,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2024-10-11 05:59:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:59:10,309 INFO L225 Difference]: With dead ends: 2846 [2024-10-11 05:59:10,309 INFO L226 Difference]: Without dead ends: 2253 [2024-10-11 05:59:10,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:59:10,310 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 748 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:59:10,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2455 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:59:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2024-10-11 05:59:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1739. [2024-10-11 05:59:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1717 states have (on average 1.3191613278974956) internal successors, (2265), 1717 states have internal predecessors, (2265), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 05:59:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2305 transitions. [2024-10-11 05:59:10,338 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2305 transitions. Word has length 351 [2024-10-11 05:59:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:59:10,339 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2305 transitions. [2024-10-11 05:59:10,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:59:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2305 transitions. [2024-10-11 05:59:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:59:10,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:59:10,342 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:59:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 05:59:10,342 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:59:10,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:59:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1600782974, now seen corresponding path program 1 times [2024-10-11 05:59:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:59:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861500613] [2024-10-11 05:59:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:59:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:59:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:59:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:59:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:59:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:59:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 05:59:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:59:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:59:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861500613] [2024-10-11 05:59:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861500613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:59:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054960464] [2024-10-11 05:59:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:13,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:59:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:59:13,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:59:13,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:59:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:14,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 05:59:14,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:59:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 05:59:14,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:59:14,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054960464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:59:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:59:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2024-10-11 05:59:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474288858] [2024-10-11 05:59:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:59:14,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:59:14,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:59:14,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:59:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:59:14,848 INFO L87 Difference]: Start difference. First operand 1739 states and 2305 transitions. Second operand has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:59:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:59:15,327 INFO L93 Difference]: Finished difference Result 2360 states and 3139 transitions. [2024-10-11 05:59:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:59:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2024-10-11 05:59:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:59:15,330 INFO L225 Difference]: With dead ends: 2360 [2024-10-11 05:59:15,330 INFO L226 Difference]: Without dead ends: 1767 [2024-10-11 05:59:15,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:59:15,332 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 381 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:59:15,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2487 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:59:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2024-10-11 05:59:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1764. [2024-10-11 05:59:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1742 states have (on average 1.3208955223880596) internal successors, (2301), 1742 states have internal predecessors, (2301), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 05:59:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2341 transitions. [2024-10-11 05:59:15,359 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2341 transitions. Word has length 351 [2024-10-11 05:59:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:59:15,359 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2341 transitions. [2024-10-11 05:59:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:59:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2341 transitions. [2024-10-11 05:59:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-11 05:59:15,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:59:15,363 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:59:15,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 05:59:15,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-10-11 05:59:15,567 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:59:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:59:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1409254429, now seen corresponding path program 1 times [2024-10-11 05:59:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:59:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495069960] [2024-10-11 05:59:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:59:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:59:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:59:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:59:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:59:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 05:59:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 05:59:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:59:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 05:59:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:59:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495069960] [2024-10-11 05:59:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495069960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:59:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:59:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:59:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070497400] [2024-10-11 05:59:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:59:16,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:59:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:59:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:59:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:59:16,220 INFO L87 Difference]: Start difference. First operand 1764 states and 2341 transitions. Second operand has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:59:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:59:16,560 INFO L93 Difference]: Finished difference Result 3051 states and 4033 transitions. [2024-10-11 05:59:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:59:16,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-10-11 05:59:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:59:16,564 INFO L225 Difference]: With dead ends: 3051 [2024-10-11 05:59:16,566 INFO L226 Difference]: Without dead ends: 1812 [2024-10-11 05:59:16,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:59:16,569 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 505 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:59:16,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1565 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:59:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-10-11 05:59:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1788. [2024-10-11 05:59:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1766 states have (on average 1.3165345413363534) internal successors, (2325), 1766 states have internal predecessors, (2325), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 05:59:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2365 transitions. [2024-10-11 05:59:16,602 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2365 transitions. Word has length 352 [2024-10-11 05:59:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:59:16,602 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2365 transitions. [2024-10-11 05:59:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:59:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2365 transitions. [2024-10-11 05:59:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-11 05:59:16,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:59:16,605 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:59:16,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 05:59:16,605 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:59:16,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:59:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1172486451, now seen corresponding path program 1 times [2024-10-11 05:59:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:59:16,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083903771] [2024-10-11 05:59:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:59:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:59:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat