./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d88022892faa8e5323e127ecf7d946bb4c2009d3a662bbf4d5eed2e18ed61b2a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:50:33,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:50:33,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:50:33,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:50:33,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:50:33,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:50:33,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:50:33,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:50:33,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:50:33,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:50:33,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:50:33,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:50:33,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:50:33,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:50:33,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:50:33,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:50:33,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:50:33,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:50:33,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:50:33,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:50:33,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:50:33,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:50:33,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:50:33,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:50:33,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:50:33,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:50:33,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:50:33,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:50:33,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:50:33,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:50:33,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:50:33,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:50:34,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:50:34,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:50:34,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:50:34,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:50:34,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:50:34,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:50:34,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:50:34,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:50:34,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:50:34,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:50:34,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d88022892faa8e5323e127ecf7d946bb4c2009d3a662bbf4d5eed2e18ed61b2a [2024-11-08 15:50:34,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:50:34,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:50:34,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:50:34,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:50:34,293 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:50:34,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2024-11-08 15:50:35,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:50:36,062 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:50:36,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2024-11-08 15:50:36,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917bce88e/c649ef9ef2ec4be38fc526e2f822bce2/FLAG43ce42a34 [2024-11-08 15:50:36,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917bce88e/c649ef9ef2ec4be38fc526e2f822bce2 [2024-11-08 15:50:36,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:50:36,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:50:36,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:50:36,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:50:36,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:50:36,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:36,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5def0c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36, skipping insertion in model container [2024-11-08 15:50:36,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:36,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:50:36,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[24514,24527] [2024-11-08 15:50:36,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:50:36,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:50:36,887 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[24514,24527] [2024-11-08 15:50:36,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:50:36,978 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:50:36,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36 WrapperNode [2024-11-08 15:50:36,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:50:36,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:50:36,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:50:36,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:50:36,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,100 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2315 [2024-11-08 15:50:37,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:50:37,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:50:37,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:50:37,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:50:37,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,167 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-11-08 15:50:37,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:50:37,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:50:37,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:50:37,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:50:37,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (1/1) ... [2024-11-08 15:50:37,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:50:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:50:37,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:50:37,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:50:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:50:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:50:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:50:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:50:37,543 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:50:37,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:50:39,217 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2024-11-08 15:50:39,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:50:39,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:50:39,251 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:50:39,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:50:39 BoogieIcfgContainer [2024-11-08 15:50:39,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:50:39,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:50:39,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:50:39,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:50:39,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:50:36" (1/3) ... [2024-11-08 15:50:39,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b4648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:50:39, skipping insertion in model container [2024-11-08 15:50:39,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:50:36" (2/3) ... [2024-11-08 15:50:39,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b4648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:50:39, skipping insertion in model container [2024-11-08 15:50:39,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:50:39" (3/3) ... [2024-11-08 15:50:39,261 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2024-11-08 15:50:39,278 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:50:39,278 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:50:39,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:50:39,383 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;@228da88e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:50:39,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:50:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 581 states, 579 states have (on average 1.7910189982728844) internal successors, (1037), 580 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 15:50:39,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:39,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:39,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash 912319734, now seen corresponding path program 1 times [2024-11-08 15:50:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:39,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227318728] [2024-11-08 15:50:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227318728] [2024-11-08 15:50:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227318728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141111613] [2024-11-08 15:50:40,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:40,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:40,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:40,368 INFO L87 Difference]: Start difference. First operand has 581 states, 579 states have (on average 1.7910189982728844) internal successors, (1037), 580 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:40,609 INFO L93 Difference]: Finished difference Result 1051 states and 1863 transitions. [2024-11-08 15:50:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:40,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-11-08 15:50:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:40,638 INFO L225 Difference]: With dead ends: 1051 [2024-11-08 15:50:40,638 INFO L226 Difference]: Without dead ends: 878 [2024-11-08 15:50:40,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:40,648 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 576 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:40,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1795 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-08 15:50:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2024-11-08 15:50:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.576) internal successors, (1379), 875 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1379 transitions. [2024-11-08 15:50:40,730 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1379 transitions. Word has length 234 [2024-11-08 15:50:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1379 transitions. [2024-11-08 15:50:40,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1379 transitions. [2024-11-08 15:50:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 15:50:40,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:40,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:50:40,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:40,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash -70671080, now seen corresponding path program 1 times [2024-11-08 15:50:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925498964] [2024-11-08 15:50:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:40,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:42,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925498964] [2024-11-08 15:50:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925498964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:42,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150371575] [2024-11-08 15:50:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:42,043 INFO L87 Difference]: Start difference. First operand 876 states and 1379 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:42,280 INFO L93 Difference]: Finished difference Result 4270 states and 6708 transitions. [2024-11-08 15:50:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:50:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-11-08 15:50:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:42,296 INFO L225 Difference]: With dead ends: 4270 [2024-11-08 15:50:42,297 INFO L226 Difference]: Without dead ends: 3405 [2024-11-08 15:50:42,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-08 15:50:42,306 INFO L432 NwaCegarLoop]: 1444 mSDtfsCounter, 2743 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2743 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:42,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2743 Valid, 3719 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2024-11-08 15:50:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 1715. [2024-11-08 15:50:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 1.5647607934655776) internal successors, (2682), 1714 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2682 transitions. [2024-11-08 15:50:42,403 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2682 transitions. Word has length 234 [2024-11-08 15:50:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:42,404 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2682 transitions. [2024-11-08 15:50:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2682 transitions. [2024-11-08 15:50:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 15:50:42,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:42,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:50:42,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:42,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1281083139, now seen corresponding path program 1 times [2024-11-08 15:50:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175109207] [2024-11-08 15:50:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175109207] [2024-11-08 15:50:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175109207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817858049] [2024-11-08 15:50:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:42,625 INFO L87 Difference]: Start difference. First operand 1715 states and 2682 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:42,746 INFO L93 Difference]: Finished difference Result 4958 states and 7722 transitions. [2024-11-08 15:50:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-11-08 15:50:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:42,759 INFO L225 Difference]: With dead ends: 4958 [2024-11-08 15:50:42,759 INFO L226 Difference]: Without dead ends: 3368 [2024-11-08 15:50:42,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:42,762 INFO L432 NwaCegarLoop]: 1702 mSDtfsCounter, 774 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:42,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2565 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2024-11-08 15:50:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3366. [2024-11-08 15:50:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 3365 states have (on average 1.5557206537890045) internal successors, (5235), 3365 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 5235 transitions. [2024-11-08 15:50:42,844 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 5235 transitions. Word has length 236 [2024-11-08 15:50:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:42,845 INFO L471 AbstractCegarLoop]: Abstraction has 3366 states and 5235 transitions. [2024-11-08 15:50:42,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 5235 transitions. [2024-11-08 15:50:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 15:50:42,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:42,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:42,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:50:42,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:42,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1522783160, now seen corresponding path program 1 times [2024-11-08 15:50:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275560292] [2024-11-08 15:50:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275560292] [2024-11-08 15:50:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275560292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611247896] [2024-11-08 15:50:43,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:43,006 INFO L87 Difference]: Start difference. First operand 3366 states and 5235 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:43,126 INFO L93 Difference]: Finished difference Result 10031 states and 15589 transitions. [2024-11-08 15:50:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:43,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-11-08 15:50:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:43,151 INFO L225 Difference]: With dead ends: 10031 [2024-11-08 15:50:43,152 INFO L226 Difference]: Without dead ends: 6703 [2024-11-08 15:50:43,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:43,164 INFO L432 NwaCegarLoop]: 1792 mSDtfsCounter, 893 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:43,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2686 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6703 states. [2024-11-08 15:50:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6703 to 3385. [2024-11-08 15:50:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.5552600472813238) internal successors, (5263), 3384 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 5263 transitions. [2024-11-08 15:50:43,286 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 5263 transitions. Word has length 236 [2024-11-08 15:50:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:43,287 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 5263 transitions. [2024-11-08 15:50:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 5263 transitions. [2024-11-08 15:50:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 15:50:43,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:43,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:43,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:50:43,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1023572120, now seen corresponding path program 1 times [2024-11-08 15:50:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491019079] [2024-11-08 15:50:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491019079] [2024-11-08 15:50:43,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491019079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:43,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857388100] [2024-11-08 15:50:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:43,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:43,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:43,455 INFO L87 Difference]: Start difference. First operand 3385 states and 5263 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:43,507 INFO L93 Difference]: Finished difference Result 6732 states and 10459 transitions. [2024-11-08 15:50:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:43,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-11-08 15:50:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:43,520 INFO L225 Difference]: With dead ends: 6732 [2024-11-08 15:50:43,521 INFO L226 Difference]: Without dead ends: 3403 [2024-11-08 15:50:43,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:43,527 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 5 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:43,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1819 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2024-11-08 15:50:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3403. [2024-11-08 15:50:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3402 states have (on average 1.5532039976484422) internal successors, (5284), 3402 states have internal predecessors, (5284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 5284 transitions. [2024-11-08 15:50:43,600 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 5284 transitions. Word has length 237 [2024-11-08 15:50:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:43,600 INFO L471 AbstractCegarLoop]: Abstraction has 3403 states and 5284 transitions. [2024-11-08 15:50:43,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 5284 transitions. [2024-11-08 15:50:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 15:50:43,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:43,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:43,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:50:43,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:43,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1450350274, now seen corresponding path program 1 times [2024-11-08 15:50:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:43,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809761404] [2024-11-08 15:50:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809761404] [2024-11-08 15:50:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809761404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:43,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664166804] [2024-11-08 15:50:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:43,835 INFO L87 Difference]: Start difference. First operand 3403 states and 5284 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:43,934 INFO L93 Difference]: Finished difference Result 9750 states and 15077 transitions. [2024-11-08 15:50:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2024-11-08 15:50:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:43,958 INFO L225 Difference]: With dead ends: 9750 [2024-11-08 15:50:43,959 INFO L226 Difference]: Without dead ends: 6588 [2024-11-08 15:50:43,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:43,966 INFO L432 NwaCegarLoop]: 1764 mSDtfsCounter, 767 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:43,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 2627 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2024-11-08 15:50:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 6586. [2024-11-08 15:50:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 1.5416856492027335) internal successors, (10152), 6585 states have internal predecessors, (10152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 10152 transitions. [2024-11-08 15:50:44,129 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 10152 transitions. Word has length 238 [2024-11-08 15:50:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:44,129 INFO L471 AbstractCegarLoop]: Abstraction has 6586 states and 10152 transitions. [2024-11-08 15:50:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 10152 transitions. [2024-11-08 15:50:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 15:50:44,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:44,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:44,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:50:44,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:44,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2126707749, now seen corresponding path program 1 times [2024-11-08 15:50:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873208210] [2024-11-08 15:50:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873208210] [2024-11-08 15:50:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873208210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306155771] [2024-11-08 15:50:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:45,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:45,079 INFO L87 Difference]: Start difference. First operand 6586 states and 10152 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:45,192 INFO L93 Difference]: Finished difference Result 18825 states and 28830 transitions. [2024-11-08 15:50:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2024-11-08 15:50:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:45,220 INFO L225 Difference]: With dead ends: 18825 [2024-11-08 15:50:45,220 INFO L226 Difference]: Without dead ends: 12775 [2024-11-08 15:50:45,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:50:45,232 INFO L432 NwaCegarLoop]: 1453 mSDtfsCounter, 862 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 3800 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:45,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 3800 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12775 states. [2024-11-08 15:50:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12775 to 6821. [2024-11-08 15:50:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6821 states, 6820 states have (on average 1.5454545454545454) internal successors, (10540), 6820 states have internal predecessors, (10540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 10540 transitions. [2024-11-08 15:50:45,434 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 10540 transitions. Word has length 238 [2024-11-08 15:50:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:45,434 INFO L471 AbstractCegarLoop]: Abstraction has 6821 states and 10540 transitions. [2024-11-08 15:50:45,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 10540 transitions. [2024-11-08 15:50:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 15:50:45,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:45,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:45,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:50:45,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash -278216409, now seen corresponding path program 1 times [2024-11-08 15:50:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853697626] [2024-11-08 15:50:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853697626] [2024-11-08 15:50:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853697626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:45,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921137488] [2024-11-08 15:50:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:45,609 INFO L87 Difference]: Start difference. First operand 6821 states and 10540 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:45,699 INFO L93 Difference]: Finished difference Result 18901 states and 28909 transitions. [2024-11-08 15:50:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:45,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2024-11-08 15:50:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:45,732 INFO L225 Difference]: With dead ends: 18901 [2024-11-08 15:50:45,733 INFO L226 Difference]: Without dead ends: 12879 [2024-11-08 15:50:45,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:45,744 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 761 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:45,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 2553 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12879 states. [2024-11-08 15:50:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12879 to 6925. [2024-11-08 15:50:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6925 states, 6924 states have (on average 1.542894280762565) internal successors, (10683), 6924 states have internal predecessors, (10683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 10683 transitions. [2024-11-08 15:50:45,927 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 10683 transitions. Word has length 240 [2024-11-08 15:50:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:45,927 INFO L471 AbstractCegarLoop]: Abstraction has 6925 states and 10683 transitions. [2024-11-08 15:50:45,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 10683 transitions. [2024-11-08 15:50:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 15:50:45,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:45,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:45,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:50:45,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash -601110319, now seen corresponding path program 1 times [2024-11-08 15:50:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534952940] [2024-11-08 15:50:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534952940] [2024-11-08 15:50:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534952940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979016258] [2024-11-08 15:50:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:46,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:46,114 INFO L87 Difference]: Start difference. First operand 6925 states and 10683 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:46,186 INFO L93 Difference]: Finished difference Result 13079 states and 20030 transitions. [2024-11-08 15:50:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-11-08 15:50:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:46,203 INFO L225 Difference]: With dead ends: 13079 [2024-11-08 15:50:46,203 INFO L226 Difference]: Without dead ends: 7050 [2024-11-08 15:50:46,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:46,213 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 5 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:46,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1818 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2024-11-08 15:50:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 7050. [2024-11-08 15:50:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7049 states have (on average 1.5362462760675273) internal successors, (10829), 7049 states have internal predecessors, (10829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10829 transitions. [2024-11-08 15:50:46,345 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10829 transitions. Word has length 241 [2024-11-08 15:50:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:46,346 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10829 transitions. [2024-11-08 15:50:46,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10829 transitions. [2024-11-08 15:50:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 15:50:46,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:46,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:46,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:50:46,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:46,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1095107996, now seen corresponding path program 1 times [2024-11-08 15:50:46,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136596591] [2024-11-08 15:50:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:46,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136596591] [2024-11-08 15:50:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136596591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478933073] [2024-11-08 15:50:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:46,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:50:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:50:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:50:46,746 INFO L87 Difference]: Start difference. First operand 7050 states and 10829 transitions. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:47,088 INFO L93 Difference]: Finished difference Result 12168 states and 18670 transitions. [2024-11-08 15:50:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:50:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-08 15:50:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:47,103 INFO L225 Difference]: With dead ends: 12168 [2024-11-08 15:50:47,104 INFO L226 Difference]: Without dead ends: 7050 [2024-11-08 15:50:47,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:50:47,113 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 2030 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:47,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 1257 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:50:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2024-11-08 15:50:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 7050. [2024-11-08 15:50:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7049 states have (on average 1.5220598666477514) internal successors, (10729), 7049 states have internal predecessors, (10729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10729 transitions. [2024-11-08 15:50:47,285 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10729 transitions. Word has length 242 [2024-11-08 15:50:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:47,286 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10729 transitions. [2024-11-08 15:50:47,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10729 transitions. [2024-11-08 15:50:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 15:50:47,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:47,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:50:47,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash -983259630, now seen corresponding path program 1 times [2024-11-08 15:50:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088737413] [2024-11-08 15:50:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:48,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088737413] [2024-11-08 15:50:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088737413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 15:50:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81629662] [2024-11-08 15:50:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:50:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:50:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:50:48,950 INFO L87 Difference]: Start difference. First operand 7050 states and 10729 transitions. Second operand has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:50,287 INFO L93 Difference]: Finished difference Result 12628 states and 19329 transitions. [2024-11-08 15:50:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:50:50,288 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-08 15:50:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:50,310 INFO L225 Difference]: With dead ends: 12628 [2024-11-08 15:50:50,310 INFO L226 Difference]: Without dead ends: 11410 [2024-11-08 15:50:50,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2024-11-08 15:50:50,319 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 5068 mSDsluCounter, 8981 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5068 SdHoareTripleChecker+Valid, 9930 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:50,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5068 Valid, 9930 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:50:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11410 states. [2024-11-08 15:50:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11410 to 7938. [2024-11-08 15:50:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7937 states have (on average 1.5085044727226913) internal successors, (11973), 7937 states have internal predecessors, (11973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11973 transitions. [2024-11-08 15:50:50,499 INFO L78 Accepts]: Start accepts. Automaton has 7938 states and 11973 transitions. Word has length 242 [2024-11-08 15:50:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:50,500 INFO L471 AbstractCegarLoop]: Abstraction has 7938 states and 11973 transitions. [2024-11-08 15:50:50,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7938 states and 11973 transitions. [2024-11-08 15:50:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 15:50:50,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:50,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:50,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:50:50,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 292390371, now seen corresponding path program 1 times [2024-11-08 15:50:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630800018] [2024-11-08 15:50:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630800018] [2024-11-08 15:50:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630800018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171431238] [2024-11-08 15:50:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:51,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:51,192 INFO L87 Difference]: Start difference. First operand 7938 states and 11973 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:51,413 INFO L93 Difference]: Finished difference Result 30515 states and 45949 transitions. [2024-11-08 15:50:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:51,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-08 15:50:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:51,461 INFO L225 Difference]: With dead ends: 30515 [2024-11-08 15:50:51,461 INFO L226 Difference]: Without dead ends: 22776 [2024-11-08 15:50:51,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:51,480 INFO L432 NwaCegarLoop]: 1436 mSDtfsCounter, 1875 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:51,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 3108 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22776 states. [2024-11-08 15:50:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22776 to 15376. [2024-11-08 15:50:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15376 states, 15375 states have (on average 1.4980162601626017) internal successors, (23032), 15375 states have internal predecessors, (23032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15376 states to 15376 states and 23032 transitions. [2024-11-08 15:50:51,842 INFO L78 Accepts]: Start accepts. Automaton has 15376 states and 23032 transitions. Word has length 242 [2024-11-08 15:50:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:51,842 INFO L471 AbstractCegarLoop]: Abstraction has 15376 states and 23032 transitions. [2024-11-08 15:50:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15376 states and 23032 transitions. [2024-11-08 15:50:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 15:50:51,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:51,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:51,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:50:51,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:51,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:51,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2139638517, now seen corresponding path program 1 times [2024-11-08 15:50:51,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:51,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114498570] [2024-11-08 15:50:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:52,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114498570] [2024-11-08 15:50:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114498570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:52,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836701432] [2024-11-08 15:50:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:52,058 INFO L87 Difference]: Start difference. First operand 15376 states and 23032 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:52,234 INFO L93 Difference]: Finished difference Result 43573 states and 64808 transitions. [2024-11-08 15:50:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2024-11-08 15:50:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:52,294 INFO L225 Difference]: With dead ends: 43573 [2024-11-08 15:50:52,295 INFO L226 Difference]: Without dead ends: 29743 [2024-11-08 15:50:52,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:52,318 INFO L432 NwaCegarLoop]: 1705 mSDtfsCounter, 753 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:52,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 2559 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29743 states. [2024-11-08 15:50:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29743 to 29741. [2024-11-08 15:50:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29741 states, 29740 states have (on average 1.4832212508406186) internal successors, (44111), 29740 states have internal predecessors, (44111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29741 states to 29741 states and 44111 transitions. [2024-11-08 15:50:52,893 INFO L78 Accepts]: Start accepts. Automaton has 29741 states and 44111 transitions. Word has length 244 [2024-11-08 15:50:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:52,893 INFO L471 AbstractCegarLoop]: Abstraction has 29741 states and 44111 transitions. [2024-11-08 15:50:52,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 29741 states and 44111 transitions. [2024-11-08 15:50:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 15:50:52,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:52,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:52,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:50:52,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:52,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1961392632, now seen corresponding path program 1 times [2024-11-08 15:50:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61821624] [2024-11-08 15:50:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61821624] [2024-11-08 15:50:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61821624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64300642] [2024-11-08 15:50:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:53,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:53,682 INFO L87 Difference]: Start difference. First operand 29741 states and 44111 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:53,854 INFO L93 Difference]: Finished difference Result 53787 states and 79401 transitions. [2024-11-08 15:50:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:53,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2024-11-08 15:50:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:53,909 INFO L225 Difference]: With dead ends: 53787 [2024-11-08 15:50:53,910 INFO L226 Difference]: Without dead ends: 26487 [2024-11-08 15:50:53,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:50:53,942 INFO L432 NwaCegarLoop]: 1035 mSDtfsCounter, 99 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:53,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2960 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26487 states. [2024-11-08 15:50:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26487 to 26411. [2024-11-08 15:50:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26411 states, 26410 states have (on average 1.482847406285498) internal successors, (39162), 26410 states have internal predecessors, (39162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26411 states to 26411 states and 39162 transitions. [2024-11-08 15:50:54,341 INFO L78 Accepts]: Start accepts. Automaton has 26411 states and 39162 transitions. Word has length 244 [2024-11-08 15:50:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:54,341 INFO L471 AbstractCegarLoop]: Abstraction has 26411 states and 39162 transitions. [2024-11-08 15:50:54,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26411 states and 39162 transitions. [2024-11-08 15:50:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 15:50:54,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:54,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:50:54,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1832944541, now seen corresponding path program 1 times [2024-11-08 15:50:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429958867] [2024-11-08 15:50:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429958867] [2024-11-08 15:50:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429958867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:55,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109758872] [2024-11-08 15:50:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:55,032 INFO L87 Difference]: Start difference. First operand 26411 states and 39162 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:55,322 INFO L93 Difference]: Finished difference Result 77311 states and 114520 transitions. [2024-11-08 15:50:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:55,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2024-11-08 15:50:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:55,407 INFO L225 Difference]: With dead ends: 77311 [2024-11-08 15:50:55,408 INFO L226 Difference]: Without dead ends: 51397 [2024-11-08 15:50:55,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:55,448 INFO L432 NwaCegarLoop]: 1448 mSDtfsCounter, 786 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:55,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 3124 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51397 states. [2024-11-08 15:50:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51397 to 51395. [2024-11-08 15:50:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51395 states, 51394 states have (on average 1.4735183095302953) internal successors, (75730), 51394 states have internal predecessors, (75730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51395 states to 51395 states and 75730 transitions. [2024-11-08 15:50:56,452 INFO L78 Accepts]: Start accepts. Automaton has 51395 states and 75730 transitions. Word has length 246 [2024-11-08 15:50:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:56,453 INFO L471 AbstractCegarLoop]: Abstraction has 51395 states and 75730 transitions. [2024-11-08 15:50:56,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51395 states and 75730 transitions. [2024-11-08 15:50:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 15:50:56,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:56,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:56,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:50:56,513 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:56,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash 637505465, now seen corresponding path program 1 times [2024-11-08 15:50:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:56,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223109534] [2024-11-08 15:50:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:56,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:56,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223109534] [2024-11-08 15:50:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223109534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979274959] [2024-11-08 15:50:56,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:56,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:56,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:56,725 INFO L87 Difference]: Start difference. First operand 51395 states and 75730 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:57,629 INFO L93 Difference]: Finished difference Result 148773 states and 218337 transitions. [2024-11-08 15:50:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:57,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-11-08 15:50:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:57,806 INFO L225 Difference]: With dead ends: 148773 [2024-11-08 15:50:57,806 INFO L226 Difference]: Without dead ends: 100425 [2024-11-08 15:50:57,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:57,879 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 745 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:57,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 2548 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100425 states. [2024-11-08 15:50:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100425 to 100377. [2024-11-08 15:50:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100377 states, 100376 states have (on average 1.461295528811668) internal successors, (146679), 100376 states have internal predecessors, (146679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100377 states to 100377 states and 146679 transitions. [2024-11-08 15:50:59,787 INFO L78 Accepts]: Start accepts. Automaton has 100377 states and 146679 transitions. Word has length 247 [2024-11-08 15:50:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:59,787 INFO L471 AbstractCegarLoop]: Abstraction has 100377 states and 146679 transitions. [2024-11-08 15:50:59,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:50:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 100377 states and 146679 transitions. [2024-11-08 15:51:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 15:51:00,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:00,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:00,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:51:00,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:00,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2035619228, now seen corresponding path program 1 times [2024-11-08 15:51:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636992489] [2024-11-08 15:51:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:00,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636992489] [2024-11-08 15:51:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636992489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680022728] [2024-11-08 15:51:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:00,969 INFO L87 Difference]: Start difference. First operand 100377 states and 146679 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:01,999 INFO L93 Difference]: Finished difference Result 282433 states and 410774 transitions. [2024-11-08 15:51:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-08 15:51:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:02,266 INFO L225 Difference]: With dead ends: 282433 [2024-11-08 15:51:02,266 INFO L226 Difference]: Without dead ends: 188105 [2024-11-08 15:51:02,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:51:02,343 INFO L432 NwaCegarLoop]: 1427 mSDtfsCounter, 838 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:02,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 3737 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188105 states. [2024-11-08 15:51:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188105 to 99711. [2024-11-08 15:51:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99711 states, 99710 states have (on average 1.4636245110821382) internal successors, (145938), 99710 states have internal predecessors, (145938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99711 states to 99711 states and 145938 transitions. [2024-11-08 15:51:04,692 INFO L78 Accepts]: Start accepts. Automaton has 99711 states and 145938 transitions. Word has length 248 [2024-11-08 15:51:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:04,692 INFO L471 AbstractCegarLoop]: Abstraction has 99711 states and 145938 transitions. [2024-11-08 15:51:04,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 99711 states and 145938 transitions. [2024-11-08 15:51:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 15:51:04,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:04,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:04,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:51:04,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1177019986, now seen corresponding path program 1 times [2024-11-08 15:51:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639912054] [2024-11-08 15:51:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639912054] [2024-11-08 15:51:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639912054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:05,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:05,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:05,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886953399] [2024-11-08 15:51:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:05,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:05,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:05,202 INFO L87 Difference]: Start difference. First operand 99711 states and 145938 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:05,793 INFO L93 Difference]: Finished difference Result 257174 states and 373279 transitions. [2024-11-08 15:51:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:05,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-08 15:51:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:05,989 INFO L225 Difference]: With dead ends: 257174 [2024-11-08 15:51:05,989 INFO L226 Difference]: Without dead ends: 178364 [2024-11-08 15:51:06,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:06,557 INFO L432 NwaCegarLoop]: 931 mSDtfsCounter, 745 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:06,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1819 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178364 states. [2024-11-08 15:51:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178364 to 100424. [2024-11-08 15:51:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100424 states, 100423 states have (on average 1.4619658843093715) internal successors, (146815), 100423 states have internal predecessors, (146815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100424 states to 100424 states and 146815 transitions. [2024-11-08 15:51:09,059 INFO L78 Accepts]: Start accepts. Automaton has 100424 states and 146815 transitions. Word has length 251 [2024-11-08 15:51:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:09,059 INFO L471 AbstractCegarLoop]: Abstraction has 100424 states and 146815 transitions. [2024-11-08 15:51:09,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 100424 states and 146815 transitions. [2024-11-08 15:51:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 15:51:09,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:09,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:09,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:51:09,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1853600832, now seen corresponding path program 1 times [2024-11-08 15:51:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140804130] [2024-11-08 15:51:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140804130] [2024-11-08 15:51:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140804130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:10,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486990439] [2024-11-08 15:51:10,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:10,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:10,285 INFO L87 Difference]: Start difference. First operand 100424 states and 146815 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:10,669 INFO L93 Difference]: Finished difference Result 192480 states and 280625 transitions. [2024-11-08 15:51:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:10,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2024-11-08 15:51:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:10,794 INFO L225 Difference]: With dead ends: 192480 [2024-11-08 15:51:10,795 INFO L226 Difference]: Without dead ends: 100428 [2024-11-08 15:51:10,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-08 15:51:10,869 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 91 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:10,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 2906 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100428 states. [2024-11-08 15:51:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100428 to 99580. [2024-11-08 15:51:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99580 states, 99579 states have (on average 1.4635816788680345) internal successors, (145742), 99579 states have internal predecessors, (145742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99580 states to 99580 states and 145742 transitions. [2024-11-08 15:51:12,902 INFO L78 Accepts]: Start accepts. Automaton has 99580 states and 145742 transitions. Word has length 252 [2024-11-08 15:51:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 99580 states and 145742 transitions. [2024-11-08 15:51:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 99580 states and 145742 transitions. [2024-11-08 15:51:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 15:51:12,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:12,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:12,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:51:12,973 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:12,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1655221817, now seen corresponding path program 1 times [2024-11-08 15:51:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101625140] [2024-11-08 15:51:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101625140] [2024-11-08 15:51:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101625140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725088638] [2024-11-08 15:51:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:13,118 INFO L87 Difference]: Start difference. First operand 99580 states and 145742 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:14,355 INFO L93 Difference]: Finished difference Result 276705 states and 402345 transitions. [2024-11-08 15:51:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-11-08 15:51:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:14,579 INFO L225 Difference]: With dead ends: 276705 [2024-11-08 15:51:14,580 INFO L226 Difference]: Without dead ends: 190079 [2024-11-08 15:51:14,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:14,665 INFO L432 NwaCegarLoop]: 1700 mSDtfsCounter, 736 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:14,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 2552 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190079 states. [2024-11-08 15:51:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190079 to 190077. [2024-11-08 15:51:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190077 states, 190076 states have (on average 1.4498253330246849) internal successors, (275577), 190076 states have internal predecessors, (275577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190077 states to 190077 states and 275577 transitions. [2024-11-08 15:51:18,586 INFO L78 Accepts]: Start accepts. Automaton has 190077 states and 275577 transitions. Word has length 254 [2024-11-08 15:51:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:18,586 INFO L471 AbstractCegarLoop]: Abstraction has 190077 states and 275577 transitions. [2024-11-08 15:51:18,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 190077 states and 275577 transitions. [2024-11-08 15:51:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 15:51:18,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:18,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:51:18,744 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:18,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash -463326811, now seen corresponding path program 1 times [2024-11-08 15:51:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157639667] [2024-11-08 15:51:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:19,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157639667] [2024-11-08 15:51:19,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157639667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:19,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:19,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949951810] [2024-11-08 15:51:19,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:19,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:19,248 INFO L87 Difference]: Start difference. First operand 190077 states and 275577 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:22,279 INFO L93 Difference]: Finished difference Result 727521 states and 1049058 transitions. [2024-11-08 15:51:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-11-08 15:51:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:23,113 INFO L225 Difference]: With dead ends: 727521 [2024-11-08 15:51:23,114 INFO L226 Difference]: Without dead ends: 540401 [2024-11-08 15:51:23,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:23,282 INFO L432 NwaCegarLoop]: 1404 mSDtfsCounter, 1574 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:23,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 3037 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540401 states. [2024-11-08 15:51:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540401 to 370787. [2024-11-08 15:51:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370787 states, 370786 states have (on average 1.4352888188874444) internal successors, (532185), 370786 states have internal predecessors, (532185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370787 states to 370787 states and 532185 transitions. [2024-11-08 15:51:31,645 INFO L78 Accepts]: Start accepts. Automaton has 370787 states and 532185 transitions. Word has length 254 [2024-11-08 15:51:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:31,645 INFO L471 AbstractCegarLoop]: Abstraction has 370787 states and 532185 transitions. [2024-11-08 15:51:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 370787 states and 532185 transitions. [2024-11-08 15:51:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-08 15:51:33,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:33,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:33,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:51:33,095 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:33,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -838619385, now seen corresponding path program 1 times [2024-11-08 15:51:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409611457] [2024-11-08 15:51:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409611457] [2024-11-08 15:51:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409611457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:33,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011049175] [2024-11-08 15:51:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:33,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:33,367 INFO L87 Difference]: Start difference. First operand 370787 states and 532185 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)