./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d2af023f2b46f9741f5603972bec3ae96ac7b65fd15f9e50fc1e49148c9ae7b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:54:22,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:54:22,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:54:22,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:54:22,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:54:23,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:54:23,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:54:23,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:54:23,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:54:23,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:54:23,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:54:23,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:54:23,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:54:23,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:54:23,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:54:23,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:54:23,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:54:23,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:54:23,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:54:23,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:54:23,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:54:23,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:54:23,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:54:23,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:54:23,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:54:23,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:54:23,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:54:23,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:54:23,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:54:23,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:54:23,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:54:23,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:54:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:54:23,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:54:23,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:54:23,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:54:23,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:54:23,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:54:23,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:54:23,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:54:23,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:54:23,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:54:23,034 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d2af023f2b46f9741f5603972bec3ae96ac7b65fd15f9e50fc1e49148c9ae7b [2024-10-11 03:54:23,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:54:23,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:54:23,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:54:23,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:54:23,383 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:54:23,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:54:24,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:54:25,180 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:54:25,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:54:25,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/00d965071/67e11ba90f894822859d2db75e8afea9/FLAGedde7bddd [2024-10-11 03:54:25,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/00d965071/67e11ba90f894822859d2db75e8afea9 [2024-10-11 03:54:25,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:54:25,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:54:25,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:54:25,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:54:25,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:54:25,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:25,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7bc247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25, skipping insertion in model container [2024-10-11 03:54:25,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:25,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:54:25,786 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7804,7817] [2024-10-11 03:54:25,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:54:25,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:54:25,900 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7804,7817] [2024-10-11 03:54:25,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:54:25,969 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:54:25,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25 WrapperNode [2024-10-11 03:54:25,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:54:25,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:54:25,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:54:25,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:54:25,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,059 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 687 [2024-10-11 03:54:26,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:54:26,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:54:26,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:54:26,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:54:26,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:54:26,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:54:26,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:54:26,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:54:26,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:54:26,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (1/1) ... [2024-10-11 03:54:26,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:54:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:54:26,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:54:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:54:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:54:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:54:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:54:26,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:54:26,379 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:54:26,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:54:27,071 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 03:54:27,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:54:27,134 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:54:27,134 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:54:27,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:54:27 BoogieIcfgContainer [2024-10-11 03:54:27,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:54:27,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:54:27,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:54:27,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:54:27,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:54:25" (1/3) ... [2024-10-11 03:54:27,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5383a1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:54:27, skipping insertion in model container [2024-10-11 03:54:27,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:54:25" (2/3) ... [2024-10-11 03:54:27,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5383a1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:54:27, skipping insertion in model container [2024-10-11 03:54:27,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:54:27" (3/3) ... [2024-10-11 03:54:27,150 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:54:27,169 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:54:27,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:54:27,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:54:27,340 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;@5c263ecd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:54:27,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:54:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.7724137931034483) internal successors, (257), 146 states have internal predecessors, (257), 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-10-11 03:54:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:54:27,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:27,360 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] [2024-10-11 03:54:27,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:27,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1865519982, now seen corresponding path program 1 times [2024-10-11 03:54:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893609127] [2024-10-11 03:54:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893609127] [2024-10-11 03:54:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893609127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:27,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965826077] [2024-10-11 03:54:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:27,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:27,966 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.7724137931034483) internal successors, (257), 146 states have internal predecessors, (257), 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 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-10-11 03:54:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:28,085 INFO L93 Difference]: Finished difference Result 319 states and 543 transitions. [2024-10-11 03:54:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2024-10-11 03:54:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:28,108 INFO L225 Difference]: With dead ends: 319 [2024-10-11 03:54:28,109 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 03:54:28,113 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-10-11 03:54:28,118 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 149 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:28,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 03:54:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2024-10-11 03:54:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 221 states have internal predecessors, (348), 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-10-11 03:54:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2024-10-11 03:54:28,173 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 61 [2024-10-11 03:54:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2024-10-11 03:54:28,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-10-11 03:54:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2024-10-11 03:54:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:54:28,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:28,178 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] [2024-10-11 03:54:28,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:54:28,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:28,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:28,179 INFO L85 PathProgramCache]: Analyzing trace with hash 152055503, now seen corresponding path program 1 times [2024-10-11 03:54:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:28,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039988462] [2024-10-11 03:54:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039988462] [2024-10-11 03:54:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039988462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:28,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139047398] [2024-10-11 03:54:28,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:28,404 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-11 03:54:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:28,452 INFO L93 Difference]: Finished difference Result 538 states and 868 transitions. [2024-10-11 03:54:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2024-10-11 03:54:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:28,456 INFO L225 Difference]: With dead ends: 538 [2024-10-11 03:54:28,456 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 03:54:28,457 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-10-11 03:54:28,458 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:28,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 413 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 03:54:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2024-10-11 03:54:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.6016260162601625) internal successors, (591), 369 states have internal predecessors, (591), 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-10-11 03:54:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2024-10-11 03:54:28,493 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 63 [2024-10-11 03:54:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:28,494 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2024-10-11 03:54:28,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-11 03:54:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2024-10-11 03:54:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:54:28,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:28,497 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] [2024-10-11 03:54:28,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:54:28,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:28,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2126698160, now seen corresponding path program 1 times [2024-10-11 03:54:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887596527] [2024-10-11 03:54:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887596527] [2024-10-11 03:54:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887596527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:28,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:28,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375935619] [2024-10-11 03:54:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:28,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:28,628 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-10-11 03:54:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:28,712 INFO L93 Difference]: Finished difference Result 966 states and 1569 transitions. [2024-10-11 03:54:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:28,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2024-10-11 03:54:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:28,722 INFO L225 Difference]: With dead ends: 966 [2024-10-11 03:54:28,722 INFO L226 Difference]: Without dead ends: 652 [2024-10-11 03:54:28,724 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-10-11 03:54:28,731 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 119 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:28,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 414 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-10-11 03:54:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2024-10-11 03:54:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.613251155624037) internal successors, (1047), 649 states have internal predecessors, (1047), 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-10-11 03:54:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1047 transitions. [2024-10-11 03:54:28,832 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1047 transitions. Word has length 65 [2024-10-11 03:54:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:28,833 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 1047 transitions. [2024-10-11 03:54:28,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-10-11 03:54:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1047 transitions. [2024-10-11 03:54:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:54:28,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:28,838 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] [2024-10-11 03:54:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:54:28,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1914747537, now seen corresponding path program 1 times [2024-10-11 03:54:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496435030] [2024-10-11 03:54:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496435030] [2024-10-11 03:54:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496435030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:29,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081658361] [2024-10-11 03:54:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:29,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:29,059 INFO L87 Difference]: Start difference. First operand 650 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-10-11 03:54:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:29,285 INFO L93 Difference]: Finished difference Result 2806 states and 4617 transitions. [2024-10-11 03:54:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:54:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-10-11 03:54:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:29,297 INFO L225 Difference]: With dead ends: 2806 [2024-10-11 03:54:29,297 INFO L226 Difference]: Without dead ends: 2212 [2024-10-11 03:54:29,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:54:29,301 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 857 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:29,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1615 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2024-10-11 03:54:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 1169. [2024-10-11 03:54:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.6241438356164384) internal successors, (1897), 1168 states have internal predecessors, (1897), 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-10-11 03:54:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1897 transitions. [2024-10-11 03:54:29,352 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1897 transitions. Word has length 67 [2024-10-11 03:54:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:29,353 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1897 transitions. [2024-10-11 03:54:29,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-10-11 03:54:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1897 transitions. [2024-10-11 03:54:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:54:29,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:29,358 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] [2024-10-11 03:54:29,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:54:29,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash -834872683, now seen corresponding path program 1 times [2024-10-11 03:54:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82917773] [2024-10-11 03:54:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82917773] [2024-10-11 03:54:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82917773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461163728] [2024-10-11 03:54:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:29,519 INFO L87 Difference]: Start difference. First operand 1169 states and 1897 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-10-11 03:54:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:29,615 INFO L93 Difference]: Finished difference Result 3408 states and 5598 transitions. [2024-10-11 03:54:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:29,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-10-11 03:54:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:29,629 INFO L225 Difference]: With dead ends: 3408 [2024-10-11 03:54:29,629 INFO L226 Difference]: Without dead ends: 2295 [2024-10-11 03:54:29,632 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-10-11 03:54:29,633 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 430 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:29,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 753 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2024-10-11 03:54:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1723. [2024-10-11 03:54:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1722 states have (on average 1.6300813008130082) internal successors, (2807), 1722 states have internal predecessors, (2807), 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-10-11 03:54:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2807 transitions. [2024-10-11 03:54:29,690 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2807 transitions. Word has length 68 [2024-10-11 03:54:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:29,690 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2807 transitions. [2024-10-11 03:54:29,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-10-11 03:54:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2807 transitions. [2024-10-11 03:54:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:54:29,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:29,693 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] [2024-10-11 03:54:29,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:54:29,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:29,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1554445324, now seen corresponding path program 1 times [2024-10-11 03:54:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:29,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496636478] [2024-10-11 03:54:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:29,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496636478] [2024-10-11 03:54:29,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496636478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:29,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649614717] [2024-10-11 03:54:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:29,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:29,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:29,797 INFO L87 Difference]: Start difference. First operand 1723 states and 2807 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 03:54:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:29,837 INFO L93 Difference]: Finished difference Result 3778 states and 6217 transitions. [2024-10-11 03:54:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-10-11 03:54:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:29,852 INFO L225 Difference]: With dead ends: 3778 [2024-10-11 03:54:29,852 INFO L226 Difference]: Without dead ends: 2590 [2024-10-11 03:54:29,855 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-10-11 03:54:29,858 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:29,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 510 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2024-10-11 03:54:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2588. [2024-10-11 03:54:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2588 states, 2587 states have (on average 1.6335523772709701) internal successors, (4226), 2587 states have internal predecessors, (4226), 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-10-11 03:54:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 4226 transitions. [2024-10-11 03:54:29,928 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 4226 transitions. Word has length 69 [2024-10-11 03:54:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:29,928 INFO L471 AbstractCegarLoop]: Abstraction has 2588 states and 4226 transitions. [2024-10-11 03:54:29,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 03:54:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 4226 transitions. [2024-10-11 03:54:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:54:29,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:29,933 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] [2024-10-11 03:54:29,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:54:29,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash 867555242, now seen corresponding path program 1 times [2024-10-11 03:54:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:29,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741982649] [2024-10-11 03:54:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:30,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741982649] [2024-10-11 03:54:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741982649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:30,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:30,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816864244] [2024-10-11 03:54:30,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:30,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:30,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:30,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:30,035 INFO L87 Difference]: Start difference. First operand 2588 states and 4226 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 03:54:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:30,079 INFO L93 Difference]: Finished difference Result 5032 states and 8245 transitions. [2024-10-11 03:54:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-10-11 03:54:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:30,094 INFO L225 Difference]: With dead ends: 5032 [2024-10-11 03:54:30,094 INFO L226 Difference]: Without dead ends: 3598 [2024-10-11 03:54:30,100 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-10-11 03:54:30,103 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 126 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:30,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 496 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2024-10-11 03:54:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3596. [2024-10-11 03:54:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 3595 states have (on average 1.6289290681502087) internal successors, (5856), 3595 states have internal predecessors, (5856), 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-10-11 03:54:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 5856 transitions. [2024-10-11 03:54:30,183 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 5856 transitions. Word has length 69 [2024-10-11 03:54:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:30,184 INFO L471 AbstractCegarLoop]: Abstraction has 3596 states and 5856 transitions. [2024-10-11 03:54:30,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 03:54:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 5856 transitions. [2024-10-11 03:54:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:54:30,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:30,186 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] [2024-10-11 03:54:30,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:54:30,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash -169195560, now seen corresponding path program 1 times [2024-10-11 03:54:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:30,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597739026] [2024-10-11 03:54:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:30,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:30,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597739026] [2024-10-11 03:54:30,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597739026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85158235] [2024-10-11 03:54:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:30,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:30,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:30,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:30,317 INFO L87 Difference]: Start difference. First operand 3596 states and 5856 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-10-11 03:54:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:30,441 INFO L93 Difference]: Finished difference Result 11302 states and 18474 transitions. [2024-10-11 03:54:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:30,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2024-10-11 03:54:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:30,470 INFO L225 Difference]: With dead ends: 11302 [2024-10-11 03:54:30,470 INFO L226 Difference]: Without dead ends: 7780 [2024-10-11 03:54:30,479 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-10-11 03:54:30,481 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 429 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:30,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 745 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2024-10-11 03:54:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 5669. [2024-10-11 03:54:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 5668 states have (on average 1.6233239237826393) internal successors, (9201), 5668 states have internal predecessors, (9201), 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-10-11 03:54:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 9201 transitions. [2024-10-11 03:54:30,637 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 9201 transitions. Word has length 69 [2024-10-11 03:54:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:30,637 INFO L471 AbstractCegarLoop]: Abstraction has 5669 states and 9201 transitions. [2024-10-11 03:54:30,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-10-11 03:54:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 9201 transitions. [2024-10-11 03:54:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:54:30,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:30,638 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] [2024-10-11 03:54:30,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:54:30,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash -73418808, now seen corresponding path program 1 times [2024-10-11 03:54:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336629906] [2024-10-11 03:54:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:30,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336629906] [2024-10-11 03:54:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336629906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:30,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:30,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801796303] [2024-10-11 03:54:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:30,725 INFO L87 Difference]: Start difference. First operand 5669 states and 9201 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 03:54:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:30,781 INFO L93 Difference]: Finished difference Result 11089 states and 18038 transitions. [2024-10-11 03:54:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-10-11 03:54:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:30,821 INFO L225 Difference]: With dead ends: 11089 [2024-10-11 03:54:30,821 INFO L226 Difference]: Without dead ends: 7837 [2024-10-11 03:54:30,830 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-10-11 03:54:30,832 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 120 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:30,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 473 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2024-10-11 03:54:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 7835. [2024-10-11 03:54:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7835 states, 7834 states have (on average 1.6153944345162115) internal successors, (12655), 7834 states have internal predecessors, (12655), 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-10-11 03:54:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7835 states to 7835 states and 12655 transitions. [2024-10-11 03:54:31,008 INFO L78 Accepts]: Start accepts. Automaton has 7835 states and 12655 transitions. Word has length 69 [2024-10-11 03:54:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:31,008 INFO L471 AbstractCegarLoop]: Abstraction has 7835 states and 12655 transitions. [2024-10-11 03:54:31,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 03:54:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7835 states and 12655 transitions. [2024-10-11 03:54:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:54:31,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:31,011 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] [2024-10-11 03:54:31,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:54:31,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:31,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1003483204, now seen corresponding path program 1 times [2024-10-11 03:54:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315032463] [2024-10-11 03:54:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:31,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315032463] [2024-10-11 03:54:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315032463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:31,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260317103] [2024-10-11 03:54:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:31,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:31,175 INFO L87 Difference]: Start difference. First operand 7835 states and 12655 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-10-11 03:54:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:31,333 INFO L93 Difference]: Finished difference Result 24464 states and 39612 transitions. [2024-10-11 03:54:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2024-10-11 03:54:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:31,371 INFO L225 Difference]: With dead ends: 24464 [2024-10-11 03:54:31,371 INFO L226 Difference]: Without dead ends: 16719 [2024-10-11 03:54:31,389 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-10-11 03:54:31,390 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 427 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:31,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 747 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16719 states. [2024-10-11 03:54:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16719 to 12234. [2024-10-11 03:54:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12234 states, 12233 states have (on average 1.6072917518188508) internal successors, (19662), 12233 states have internal predecessors, (19662), 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-10-11 03:54:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 19662 transitions. [2024-10-11 03:54:31,642 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 19662 transitions. Word has length 70 [2024-10-11 03:54:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:31,643 INFO L471 AbstractCegarLoop]: Abstraction has 12234 states and 19662 transitions. [2024-10-11 03:54:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-10-11 03:54:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 19662 transitions. [2024-10-11 03:54:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:54:31,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:31,644 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] [2024-10-11 03:54:31,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:54:31,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:31,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:31,645 INFO L85 PathProgramCache]: Analyzing trace with hash 502971341, now seen corresponding path program 1 times [2024-10-11 03:54:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997135755] [2024-10-11 03:54:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997135755] [2024-10-11 03:54:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997135755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:31,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:31,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412191347] [2024-10-11 03:54:31,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:31,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:31,962 INFO L87 Difference]: Start difference. First operand 12234 states and 19662 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-10-11 03:54:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:32,126 INFO L93 Difference]: Finished difference Result 24380 states and 39201 transitions. [2024-10-11 03:54:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2024-10-11 03:54:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:32,159 INFO L225 Difference]: With dead ends: 24380 [2024-10-11 03:54:32,159 INFO L226 Difference]: Without dead ends: 12236 [2024-10-11 03:54:32,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:54:32,182 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 358 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:32,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 605 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12236 states. [2024-10-11 03:54:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12236 to 12234. [2024-10-11 03:54:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12234 states, 12233 states have (on average 1.597073489740865) internal successors, (19537), 12233 states have internal predecessors, (19537), 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-10-11 03:54:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 19537 transitions. [2024-10-11 03:54:32,385 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 19537 transitions. Word has length 72 [2024-10-11 03:54:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:32,386 INFO L471 AbstractCegarLoop]: Abstraction has 12234 states and 19537 transitions. [2024-10-11 03:54:32,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-10-11 03:54:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 19537 transitions. [2024-10-11 03:54:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:54:32,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:32,387 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] [2024-10-11 03:54:32,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:54:32,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:32,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1124745034, now seen corresponding path program 1 times [2024-10-11 03:54:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993282090] [2024-10-11 03:54:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993282090] [2024-10-11 03:54:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993282090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029945663] [2024-10-11 03:54:32,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:32,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:32,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:32,636 INFO L87 Difference]: Start difference. First operand 12234 states and 19537 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-10-11 03:54:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:32,820 INFO L93 Difference]: Finished difference Result 35012 states and 56061 transitions. [2024-10-11 03:54:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2024-10-11 03:54:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:32,872 INFO L225 Difference]: With dead ends: 35012 [2024-10-11 03:54:32,873 INFO L226 Difference]: Without dead ends: 22868 [2024-10-11 03:54:32,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:54:32,898 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 118 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:32,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 809 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22868 states. [2024-10-11 03:54:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22868 to 22866. [2024-10-11 03:54:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22866 states, 22865 states have (on average 1.5857424010496393) internal successors, (36258), 22865 states have internal predecessors, (36258), 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-10-11 03:54:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22866 states to 22866 states and 36258 transitions. [2024-10-11 03:54:33,325 INFO L78 Accepts]: Start accepts. Automaton has 22866 states and 36258 transitions. Word has length 75 [2024-10-11 03:54:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:33,325 INFO L471 AbstractCegarLoop]: Abstraction has 22866 states and 36258 transitions. [2024-10-11 03:54:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-10-11 03:54:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 22866 states and 36258 transitions. [2024-10-11 03:54:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:54:33,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:33,326 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] [2024-10-11 03:54:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:54:33,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 505448394, now seen corresponding path program 1 times [2024-10-11 03:54:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730034061] [2024-10-11 03:54:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730034061] [2024-10-11 03:54:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730034061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732317066] [2024-10-11 03:54:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:33,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:33,866 INFO L87 Difference]: Start difference. First operand 22866 states and 36258 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-10-11 03:54:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:33,989 INFO L93 Difference]: Finished difference Result 23592 states and 37345 transitions. [2024-10-11 03:54:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2024-10-11 03:54:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:34,035 INFO L225 Difference]: With dead ends: 23592 [2024-10-11 03:54:34,037 INFO L226 Difference]: Without dead ends: 23590 [2024-10-11 03:54:34,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:34,050 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:34,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 862 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23590 states. [2024-10-11 03:54:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23590 to 23590. [2024-10-11 03:54:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23590 states, 23589 states have (on average 1.567383102293442) internal successors, (36973), 23589 states have internal predecessors, (36973), 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-10-11 03:54:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23590 states to 23590 states and 36973 transitions. [2024-10-11 03:54:34,498 INFO L78 Accepts]: Start accepts. Automaton has 23590 states and 36973 transitions. Word has length 76 [2024-10-11 03:54:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 23590 states and 36973 transitions. [2024-10-11 03:54:34,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-10-11 03:54:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23590 states and 36973 transitions. [2024-10-11 03:54:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:54:34,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:34,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:34,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:54:34,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1515871777, now seen corresponding path program 1 times [2024-10-11 03:54:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:34,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507834832] [2024-10-11 03:54:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:54:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507834832] [2024-10-11 03:54:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507834832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:34,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:34,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:34,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786649289] [2024-10-11 03:54:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:34,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:34,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:34,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:34,854 INFO L87 Difference]: Start difference. First operand 23590 states and 36973 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-10-11 03:54:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:35,252 INFO L93 Difference]: Finished difference Result 57666 states and 90689 transitions. [2024-10-11 03:54:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:35,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 100 [2024-10-11 03:54:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:35,366 INFO L225 Difference]: With dead ends: 57666 [2024-10-11 03:54:35,367 INFO L226 Difference]: Without dead ends: 46304 [2024-10-11 03:54:35,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:54:35,400 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 543 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:35,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1086 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46304 states. [2024-10-11 03:54:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46304 to 36198. [2024-10-11 03:54:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36198 states, 36197 states have (on average 1.5652402132773435) internal successors, (56657), 36197 states have internal predecessors, (56657), 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-10-11 03:54:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36198 states to 36198 states and 56657 transitions. [2024-10-11 03:54:36,041 INFO L78 Accepts]: Start accepts. Automaton has 36198 states and 56657 transitions. Word has length 100 [2024-10-11 03:54:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:36,041 INFO L471 AbstractCegarLoop]: Abstraction has 36198 states and 56657 transitions. [2024-10-11 03:54:36,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-10-11 03:54:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 36198 states and 56657 transitions. [2024-10-11 03:54:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:54:36,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:36,044 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:54:36,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:36,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2092205437, now seen corresponding path program 1 times [2024-10-11 03:54:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859150424] [2024-10-11 03:54:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:54:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859150424] [2024-10-11 03:54:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859150424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864983003] [2024-10-11 03:54:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:36,375 INFO L87 Difference]: Start difference. First operand 36198 states and 56657 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-10-11 03:54:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:36,725 INFO L93 Difference]: Finished difference Result 64668 states and 101701 transitions. [2024-10-11 03:54:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 100 [2024-10-11 03:54:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:36,815 INFO L225 Difference]: With dead ends: 64668 [2024-10-11 03:54:36,815 INFO L226 Difference]: Without dead ends: 53536 [2024-10-11 03:54:36,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:54:36,848 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 550 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:36,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 994 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53536 states. [2024-10-11 03:54:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53536 to 49018. [2024-10-11 03:54:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49018 states, 49017 states have (on average 1.5666605463410654) internal successors, (76793), 49017 states have internal predecessors, (76793), 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-10-11 03:54:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49018 states to 49018 states and 76793 transitions. [2024-10-11 03:54:37,743 INFO L78 Accepts]: Start accepts. Automaton has 49018 states and 76793 transitions. Word has length 100 [2024-10-11 03:54:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 49018 states and 76793 transitions. [2024-10-11 03:54:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-10-11 03:54:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49018 states and 76793 transitions. [2024-10-11 03:54:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:54:37,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:37,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:54:37,747 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:37,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1151231387, now seen corresponding path program 1 times [2024-10-11 03:54:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:37,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2330996] [2024-10-11 03:54:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:54:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2330996] [2024-10-11 03:54:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2330996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:37,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:37,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468529641] [2024-10-11 03:54:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:37,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:37,915 INFO L87 Difference]: Start difference. First operand 49018 states and 76793 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-10-11 03:54:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:38,486 INFO L93 Difference]: Finished difference Result 69088 states and 108649 transitions. [2024-10-11 03:54:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 100 [2024-10-11 03:54:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:38,600 INFO L225 Difference]: With dead ends: 69088 [2024-10-11 03:54:38,601 INFO L226 Difference]: Without dead ends: 57956 [2024-10-11 03:54:38,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:54:38,631 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 555 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:38,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1087 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:54:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57956 states. [2024-10-11 03:54:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57956 to 56158. [2024-10-11 03:54:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56158 states, 56157 states have (on average 1.5682639742151467) internal successors, (88069), 56157 states have internal predecessors, (88069), 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-10-11 03:54:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56158 states to 56158 states and 88069 transitions. [2024-10-11 03:54:39,508 INFO L78 Accepts]: Start accepts. Automaton has 56158 states and 88069 transitions. Word has length 100 [2024-10-11 03:54:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:39,509 INFO L471 AbstractCegarLoop]: Abstraction has 56158 states and 88069 transitions. [2024-10-11 03:54:39,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-10-11 03:54:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 56158 states and 88069 transitions. [2024-10-11 03:54:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:54:39,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:39,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:39,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:54:39,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:39,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 190110983, now seen corresponding path program 1 times [2024-10-11 03:54:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503154061] [2024-10-11 03:54:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:54:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503154061] [2024-10-11 03:54:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503154061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438881245] [2024-10-11 03:54:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:39,646 INFO L87 Difference]: Start difference. First operand 56158 states and 88069 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-10-11 03:54:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:40,456 INFO L93 Difference]: Finished difference Result 91421 states and 144038 transitions. [2024-10-11 03:54:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 101 [2024-10-11 03:54:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:40,576 INFO L225 Difference]: With dead ends: 91421 [2024-10-11 03:54:40,576 INFO L226 Difference]: Without dead ends: 72827 [2024-10-11 03:54:40,610 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-10-11 03:54:40,611 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 249 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:40,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 700 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72827 states. [2024-10-11 03:54:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72827 to 71031. [2024-10-11 03:54:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71031 states, 71030 states have (on average 1.5684499507250458) internal successors, (111407), 71030 states have internal predecessors, (111407), 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-10-11 03:54:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71031 states to 71031 states and 111407 transitions. [2024-10-11 03:54:41,955 INFO L78 Accepts]: Start accepts. Automaton has 71031 states and 111407 transitions. Word has length 101 [2024-10-11 03:54:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:41,956 INFO L471 AbstractCegarLoop]: Abstraction has 71031 states and 111407 transitions. [2024-10-11 03:54:41,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-10-11 03:54:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 71031 states and 111407 transitions. [2024-10-11 03:54:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:54:41,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:41,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:54:41,959 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -158576971, now seen corresponding path program 1 times [2024-10-11 03:54:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281073592] [2024-10-11 03:54:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:54:42,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281073592] [2024-10-11 03:54:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281073592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:42,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:42,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:42,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547246244] [2024-10-11 03:54:42,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:42,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:42,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:42,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:42,062 INFO L87 Difference]: Start difference. First operand 71031 states and 111407 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-10-11 03:54:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:42,708 INFO L93 Difference]: Finished difference Result 153123 states and 240887 transitions. [2024-10-11 03:54:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 101 [2024-10-11 03:54:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:42,983 INFO L225 Difference]: With dead ends: 153123 [2024-10-11 03:54:42,983 INFO L226 Difference]: Without dead ends: 119825 [2024-10-11 03:54:43,057 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-10-11 03:54:43,058 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 110 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:43,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 403 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119825 states. [2024-10-11 03:54:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119825 to 119547. [2024-10-11 03:54:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119547 states, 119546 states have (on average 1.5682498787077777) internal successors, (187478), 119546 states have internal predecessors, (187478), 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-10-11 03:54:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119547 states to 119547 states and 187478 transitions. [2024-10-11 03:54:45,209 INFO L78 Accepts]: Start accepts. Automaton has 119547 states and 187478 transitions. Word has length 101 [2024-10-11 03:54:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 119547 states and 187478 transitions. [2024-10-11 03:54:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-10-11 03:54:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 119547 states and 187478 transitions. [2024-10-11 03:54:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:54:45,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:45,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:45,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:54:45,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:45,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1717689480, now seen corresponding path program 1 times [2024-10-11 03:54:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760033343] [2024-10-11 03:54:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:45,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760033343] [2024-10-11 03:54:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760033343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114596492] [2024-10-11 03:54:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:45,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:45,383 INFO L87 Difference]: Start difference. First operand 119547 states and 187478 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:54:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:46,684 INFO L93 Difference]: Finished difference Result 220887 states and 346710 transitions. [2024-10-11 03:54:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:46,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2024-10-11 03:54:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:46,875 INFO L225 Difference]: With dead ends: 220887 [2024-10-11 03:54:46,875 INFO L226 Difference]: Without dead ends: 101430 [2024-10-11 03:54:46,945 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-10-11 03:54:46,946 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 94 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:46,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 492 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101430 states. [2024-10-11 03:54:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101430 to 101200. [2024-10-11 03:54:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101200 states, 101199 states have (on average 1.5622782833822468) internal successors, (158101), 101199 states have internal predecessors, (158101), 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-10-11 03:54:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101200 states to 101200 states and 158101 transitions. [2024-10-11 03:54:48,701 INFO L78 Accepts]: Start accepts. Automaton has 101200 states and 158101 transitions. Word has length 102 [2024-10-11 03:54:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:48,702 INFO L471 AbstractCegarLoop]: Abstraction has 101200 states and 158101 transitions. [2024-10-11 03:54:48,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:54:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 101200 states and 158101 transitions. [2024-10-11 03:54:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:54:48,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:48,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:48,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:54:48,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1636303766, now seen corresponding path program 1 times [2024-10-11 03:54:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143663836] [2024-10-11 03:54:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143663836] [2024-10-11 03:54:48,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143663836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:48,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:48,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058980249] [2024-10-11 03:54:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:48,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:48,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:48,898 INFO L87 Difference]: Start difference. First operand 101200 states and 158101 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:54:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:50,040 INFO L93 Difference]: Finished difference Result 143672 states and 224581 transitions. [2024-10-11 03:54:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:50,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2024-10-11 03:54:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:50,110 INFO L225 Difference]: With dead ends: 143672 [2024-10-11 03:54:50,111 INFO L226 Difference]: Without dead ends: 42563 [2024-10-11 03:54:50,164 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-10-11 03:54:50,165 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 81 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:50,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 443 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42563 states. [2024-10-11 03:54:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42563 to 42493. [2024-10-11 03:54:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42493 states, 42492 states have (on average 1.5561046785277228) internal successors, (66122), 42492 states have internal predecessors, (66122), 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-10-11 03:54:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42493 states to 42493 states and 66122 transitions. [2024-10-11 03:54:50,702 INFO L78 Accepts]: Start accepts. Automaton has 42493 states and 66122 transitions. Word has length 102 [2024-10-11 03:54:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 42493 states and 66122 transitions. [2024-10-11 03:54:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:54:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 42493 states and 66122 transitions. [2024-10-11 03:54:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:54:50,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:50,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:50,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:54:50,704 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:50,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1335068748, now seen corresponding path program 1 times [2024-10-11 03:54:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:50,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297858581] [2024-10-11 03:54:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297858581] [2024-10-11 03:54:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297858581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:50,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:50,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:50,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330520713] [2024-10-11 03:54:50,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:50,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:50,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:50,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:50,835 INFO L87 Difference]: Start difference. First operand 42493 states and 66122 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:54:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:51,602 INFO L93 Difference]: Finished difference Result 62279 states and 96986 transitions. [2024-10-11 03:54:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2024-10-11 03:54:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:51,639 INFO L225 Difference]: With dead ends: 62279 [2024-10-11 03:54:51,640 INFO L226 Difference]: Without dead ends: 19877 [2024-10-11 03:54:51,670 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-10-11 03:54:51,671 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 68 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:51,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 394 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19877 states. [2024-10-11 03:54:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19877 to 19871. [2024-10-11 03:54:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19871 states, 19870 states have (on average 1.5503271263210872) internal successors, (30805), 19870 states have internal predecessors, (30805), 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-10-11 03:54:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19871 states to 19871 states and 30805 transitions. [2024-10-11 03:54:51,931 INFO L78 Accepts]: Start accepts. Automaton has 19871 states and 30805 transitions. Word has length 102 [2024-10-11 03:54:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:51,931 INFO L471 AbstractCegarLoop]: Abstraction has 19871 states and 30805 transitions. [2024-10-11 03:54:51,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:54:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19871 states and 30805 transitions. [2024-10-11 03:54:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:54:51,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:51,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:51,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:54:51,933 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:51,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1753216283, now seen corresponding path program 1 times [2024-10-11 03:54:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351122773] [2024-10-11 03:54:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:54:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351122773] [2024-10-11 03:54:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351122773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:52,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475690595] [2024-10-11 03:54:52,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:52,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:52,302 INFO L87 Difference]: Start difference. First operand 19871 states and 30805 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-10-11 03:54:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:52,504 INFO L93 Difference]: Finished difference Result 49011 states and 75987 transitions. [2024-10-11 03:54:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 103 [2024-10-11 03:54:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:52,571 INFO L225 Difference]: With dead ends: 49011 [2024-10-11 03:54:52,571 INFO L226 Difference]: Without dead ends: 36547 [2024-10-11 03:54:52,599 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-10-11 03:54:52,600 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 409 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:52,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 632 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36547 states. [2024-10-11 03:54:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36547 to 31423. [2024-10-11 03:54:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31423 states, 31422 states have (on average 1.5492966711221436) internal successors, (48682), 31422 states have internal predecessors, (48682), 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-10-11 03:54:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31423 states to 31423 states and 48682 transitions. [2024-10-11 03:54:53,247 INFO L78 Accepts]: Start accepts. Automaton has 31423 states and 48682 transitions. Word has length 103 [2024-10-11 03:54:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:53,247 INFO L471 AbstractCegarLoop]: Abstraction has 31423 states and 48682 transitions. [2024-10-11 03:54:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-10-11 03:54:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31423 states and 48682 transitions. [2024-10-11 03:54:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:54:53,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:53,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:54:53,249 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash -78311717, now seen corresponding path program 1 times [2024-10-11 03:54:53,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794118395] [2024-10-11 03:54:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:54:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794118395] [2024-10-11 03:54:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794118395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:53,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:53,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121449271] [2024-10-11 03:54:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:53,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:53,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:53,596 INFO L87 Difference]: Start difference. First operand 31423 states and 48682 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-10-11 03:54:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:53,808 INFO L93 Difference]: Finished difference Result 75197 states and 116527 transitions. [2024-10-11 03:54:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:53,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 103 [2024-10-11 03:54:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:53,896 INFO L225 Difference]: With dead ends: 75197 [2024-10-11 03:54:53,896 INFO L226 Difference]: Without dead ends: 56369 [2024-10-11 03:54:53,927 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-10-11 03:54:53,928 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 420 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:53,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 624 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56369 states. [2024-10-11 03:54:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56369 to 49639. [2024-10-11 03:54:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49639 states, 49638 states have (on average 1.5488537007937466) internal successors, (76882), 49638 states have internal predecessors, (76882), 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-10-11 03:54:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49639 states to 49639 states and 76882 transitions. [2024-10-11 03:54:54,783 INFO L78 Accepts]: Start accepts. Automaton has 49639 states and 76882 transitions. Word has length 103 [2024-10-11 03:54:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:54,784 INFO L471 AbstractCegarLoop]: Abstraction has 49639 states and 76882 transitions. [2024-10-11 03:54:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-10-11 03:54:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 49639 states and 76882 transitions. [2024-10-11 03:54:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:54:54,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:54,785 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:54,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:54:54,785 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:54,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1440657073, now seen corresponding path program 1 times [2024-10-11 03:54:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836887226] [2024-10-11 03:54:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:54,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:54,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836887226] [2024-10-11 03:54:54,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836887226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:54,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:54,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:54,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369446928] [2024-10-11 03:54:54,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:54,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:54,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:54,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:54,882 INFO L87 Difference]: Start difference. First operand 49639 states and 76882 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10-11 03:54:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:55,383 INFO L93 Difference]: Finished difference Result 146022 states and 225846 transitions. [2024-10-11 03:54:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2024-10-11 03:54:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:55,556 INFO L225 Difference]: With dead ends: 146022 [2024-10-11 03:54:55,557 INFO L226 Difference]: Without dead ends: 96475 [2024-10-11 03:54:55,622 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-10-11 03:54:55,623 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 171 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:55,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 541 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96475 states. [2024-10-11 03:54:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96475 to 96473. [2024-10-11 03:54:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96473 states, 96472 states have (on average 1.5357720374823782) internal successors, (148159), 96472 states have internal predecessors, (148159), 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-10-11 03:54:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96473 states to 96473 states and 148159 transitions. [2024-10-11 03:54:57,240 INFO L78 Accepts]: Start accepts. Automaton has 96473 states and 148159 transitions. Word has length 104 [2024-10-11 03:54:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 96473 states and 148159 transitions. [2024-10-11 03:54:57,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10-11 03:54:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 96473 states and 148159 transitions. [2024-10-11 03:54:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:54:57,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:57,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:57,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:54:57,243 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1731084199, now seen corresponding path program 1 times [2024-10-11 03:54:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392268139] [2024-10-11 03:54:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392268139] [2024-10-11 03:54:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392268139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:57,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635883078] [2024-10-11 03:54:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:57,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:57,339 INFO L87 Difference]: Start difference. First operand 96473 states and 148159 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10-11 03:54:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:58,771 INFO L93 Difference]: Finished difference Result 283629 states and 434881 transitions. [2024-10-11 03:54:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2024-10-11 03:54:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:59,112 INFO L225 Difference]: With dead ends: 283629 [2024-10-11 03:54:59,112 INFO L226 Difference]: Without dead ends: 187296 [2024-10-11 03:54:59,215 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-10-11 03:54:59,216 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:59,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 512 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187296 states. [2024-10-11 03:55:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187296 to 187294. [2024-10-11 03:55:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187294 states, 187293 states have (on average 1.5219255391285311) internal successors, (285046), 187293 states have internal predecessors, (285046), 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-10-11 03:55:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187294 states to 187294 states and 285046 transitions. [2024-10-11 03:55:02,361 INFO L78 Accepts]: Start accepts. Automaton has 187294 states and 285046 transitions. Word has length 104 [2024-10-11 03:55:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:02,361 INFO L471 AbstractCegarLoop]: Abstraction has 187294 states and 285046 transitions. [2024-10-11 03:55:02,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10-11 03:55:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 187294 states and 285046 transitions. [2024-10-11 03:55:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:55:02,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:02,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:55:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:55:02,364 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:02,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 650037642, now seen corresponding path program 1 times [2024-10-11 03:55:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879205808] [2024-10-11 03:55:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:55:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879205808] [2024-10-11 03:55:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879205808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658624925] [2024-10-11 03:55:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:02,463 INFO L87 Difference]: Start difference. First operand 187294 states and 285046 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-10-11 03:55:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:04,794 INFO L93 Difference]: Finished difference Result 463804 states and 704734 transitions. [2024-10-11 03:55:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 105 [2024-10-11 03:55:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:05,377 INFO L225 Difference]: With dead ends: 463804 [2024-10-11 03:55:05,377 INFO L226 Difference]: Without dead ends: 276784 [2024-10-11 03:55:05,534 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-10-11 03:55:05,535 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 114 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:05,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 439 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276784 states. [2024-10-11 03:55:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276784 to 189150. [2024-10-11 03:55:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189150 states, 189149 states have (on average 1.5216786765988717) internal successors, (287824), 189149 states have internal predecessors, (287824), 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-10-11 03:55:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189150 states to 189150 states and 287824 transitions. [2024-10-11 03:55:08,992 INFO L78 Accepts]: Start accepts. Automaton has 189150 states and 287824 transitions. Word has length 105 [2024-10-11 03:55:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:08,992 INFO L471 AbstractCegarLoop]: Abstraction has 189150 states and 287824 transitions. [2024-10-11 03:55:08,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-10-11 03:55:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 189150 states and 287824 transitions. [2024-10-11 03:55:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:55:08,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:08,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:55:08,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:55:08,994 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:08,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1716173256, now seen corresponding path program 1 times [2024-10-11 03:55:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:08,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577910083] [2024-10-11 03:55:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:08,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:55:09,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:09,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577910083] [2024-10-11 03:55:09,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577910083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:09,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:09,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155827740] [2024-10-11 03:55:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:09,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:09,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:09,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:09,796 INFO L87 Difference]: Start difference. First operand 189150 states and 287824 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:55:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:11,529 INFO L93 Difference]: Finished difference Result 457694 states and 695682 transitions. [2024-10-11 03:55:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 105 [2024-10-11 03:55:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:12,066 INFO L225 Difference]: With dead ends: 457694 [2024-10-11 03:55:12,066 INFO L226 Difference]: Without dead ends: 268872 [2024-10-11 03:55:12,258 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-10-11 03:55:12,259 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 120 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:12,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 442 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268872 states. [2024-10-11 03:55:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268872 to 191006. [2024-10-11 03:55:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191006 states, 191005 states have (on average 1.521436611607026) internal successors, (290602), 191005 states have internal predecessors, (290602), 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-10-11 03:55:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191006 states to 191006 states and 290602 transitions. [2024-10-11 03:55:17,073 INFO L78 Accepts]: Start accepts. Automaton has 191006 states and 290602 transitions. Word has length 105 [2024-10-11 03:55:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:17,074 INFO L471 AbstractCegarLoop]: Abstraction has 191006 states and 290602 transitions. [2024-10-11 03:55:17,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-10-11 03:55:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 191006 states and 290602 transitions. [2024-10-11 03:55:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:55:17,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:17,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:55:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:55:17,075 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1572025829, now seen corresponding path program 1 times [2024-10-11 03:55:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945736999] [2024-10-11 03:55:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:55:17,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:17,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945736999] [2024-10-11 03:55:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945736999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864503969] [2024-10-11 03:55:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:17,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:17,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:17,176 INFO L87 Difference]: Start difference. First operand 191006 states and 290602 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-10-11 03:55:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:18,120 INFO L93 Difference]: Finished difference Result 368950 states and 562040 transitions. [2024-10-11 03:55:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 107 [2024-10-11 03:55:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.