./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/pals_floodmax.3.1.ufo.UNBOUNDED.pals.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/pals_floodmax.3.1.ufo.UNBOUNDED.pals.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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:17:59,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:17:59,109 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:17:59,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:17:59,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:17:59,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:17:59,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:17:59,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:17:59,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:17:59,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:17:59,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:17:59,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:17:59,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:17:59,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:17:59,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:17:59,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:17:59,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:17:59,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:17:59,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:17:59,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:17:59,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:17:59,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:17:59,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:17:59,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:17:59,174 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:17:59,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:17:59,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:17:59,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:17:59,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:17:59,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:17:59,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:17:59,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:17:59,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:59,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:17:59,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:17:59,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:17:59,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:17:59,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:17:59,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:17:59,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:17:59,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:17:59,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:17:59,180 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-10-11 03:17:59,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:17:59,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:17:59,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:17:59,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:17:59,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:17:59,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-11 03:18:00,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:18:01,157 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:18:01,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-11 03:18:01,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d38d9651/9f3888bf5caf4b40a802add3e884f89a/FLAG990043b70 [2024-10-11 03:18:01,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d38d9651/9f3888bf5caf4b40a802add3e884f89a [2024-10-11 03:18:01,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:18:01,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:18:01,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:18:01,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:18:01,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:18:01,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:18:01" (1/1) ... [2024-10-11 03:18:01,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76199251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:01, skipping insertion in model container [2024-10-11 03:18:01,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:18:01" (1/1) ... [2024-10-11 03:18:01,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:18:01,888 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/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-10-11 03:18:01,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:18:01,909 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:18:01,980 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/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-10-11 03:18:01,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:18:02,012 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:18:02,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02 WrapperNode [2024-10-11 03:18:02,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:18:02,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:18:02,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:18:02,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:18:02,018 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:18:02" (1/1) ... [2024-10-11 03:18:02,028 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:18:02" (1/1) ... [2024-10-11 03:18:02,077 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 442 [2024-10-11 03:18:02,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:18:02,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:18:02,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:18:02,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:18:02,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,127 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:18:02,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:18:02,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:18:02,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:18:02,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:18:02,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (1/1) ... [2024-10-11 03:18:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:18:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:02,214 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:18:02,221 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:18:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:18:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:18:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:18:02,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:18:02,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:18:02,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:18:03,081 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-11 03:18:03,082 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:18:03,136 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:18:03,136 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:18:03,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:18:03 BoogieIcfgContainer [2024-10-11 03:18:03,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:18:03,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:18:03,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:18:03,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:18:03,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:18:01" (1/3) ... [2024-10-11 03:18:03,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78de97ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:18:03, skipping insertion in model container [2024-10-11 03:18:03,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:02" (2/3) ... [2024-10-11 03:18:03,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78de97ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:18:03, skipping insertion in model container [2024-10-11 03:18:03,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:18:03" (3/3) ... [2024-10-11 03:18:03,147 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-11 03:18:03,163 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:18:03,163 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:18:03,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:18:03,241 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;@58d9ed59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:18:03,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:18:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.7946428571428572) internal successors, (201), 113 states have internal predecessors, (201), 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:18:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:18:03,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:03,262 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] [2024-10-11 03:18:03,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:03,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1320925119, now seen corresponding path program 1 times [2024-10-11 03:18:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830209666] [2024-10-11 03:18:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,644 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:18:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830209666] [2024-10-11 03:18:03,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830209666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:03,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:03,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:18:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465584151] [2024-10-11 03:18:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:18:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:18:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:18:03,684 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.7946428571428572) internal successors, (201), 113 states have internal predecessors, (201), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:18:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:03,733 INFO L93 Difference]: Finished difference Result 178 states and 313 transitions. [2024-10-11 03:18:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:18:03,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2024-10-11 03:18:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:03,750 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:18:03,750 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 03:18:03,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:18:03,759 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:03,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 03:18:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 03:18:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7657657657657657) internal successors, (196), 111 states have internal predecessors, (196), 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:18:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 196 transitions. [2024-10-11 03:18:03,813 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 196 transitions. Word has length 34 [2024-10-11 03:18:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:03,814 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 196 transitions. [2024-10-11 03:18:03,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:18:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 196 transitions. [2024-10-11 03:18:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:18:03,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:03,816 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] [2024-10-11 03:18:03,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:18:03,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:03,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1285098435, now seen corresponding path program 1 times [2024-10-11 03:18:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431871077] [2024-10-11 03:18:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,147 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:18:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431871077] [2024-10-11 03:18:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431871077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:18:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510656468] [2024-10-11 03:18:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:04,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:04,153 INFO L87 Difference]: Start difference. First operand 112 states and 196 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:18:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:04,253 INFO L93 Difference]: Finished difference Result 178 states and 307 transitions. [2024-10-11 03:18:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:18:04,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-10-11 03:18:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:04,256 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:18:04,256 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 03:18:04,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:04,259 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:04,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 03:18:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 03:18:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 111 states have internal predecessors, (175), 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:18:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 175 transitions. [2024-10-11 03:18:04,275 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 175 transitions. Word has length 34 [2024-10-11 03:18:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:04,276 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 175 transitions. [2024-10-11 03:18:04,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:18:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 175 transitions. [2024-10-11 03:18:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:18:04,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:04,278 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] [2024-10-11 03:18:04,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:18:04,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:04,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1491954151, now seen corresponding path program 1 times [2024-10-11 03:18:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805318370] [2024-10-11 03:18:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805318370] [2024-10-11 03:18:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805318370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:04,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530606448] [2024-10-11 03:18:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:04,458 INFO L87 Difference]: Start difference. First operand 112 states and 175 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:18:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:04,533 INFO L93 Difference]: Finished difference Result 229 states and 374 transitions. [2024-10-11 03:18:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2024-10-11 03:18:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:04,537 INFO L225 Difference]: With dead ends: 229 [2024-10-11 03:18:04,539 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 03:18:04,540 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:18:04,541 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 82 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:04,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 305 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 03:18:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-10-11 03:18:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 162 states have internal predecessors, (258), 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:18:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 258 transitions. [2024-10-11 03:18:04,566 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 258 transitions. Word has length 54 [2024-10-11 03:18:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 258 transitions. [2024-10-11 03:18:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:18:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 258 transitions. [2024-10-11 03:18:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:18:04,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:04,573 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] [2024-10-11 03:18:04,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:18:04,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2133310945, now seen corresponding path program 1 times [2024-10-11 03:18:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192933390] [2024-10-11 03:18:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,707 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:18:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192933390] [2024-10-11 03:18:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192933390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519749822] [2024-10-11 03:18:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:04,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:04,712 INFO L87 Difference]: Start difference. First operand 163 states and 258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:18:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:04,751 INFO L93 Difference]: Finished difference Result 377 states and 614 transitions. [2024-10-11 03:18:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2024-10-11 03:18:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:04,754 INFO L225 Difference]: With dead ends: 377 [2024-10-11 03:18:04,755 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 03:18:04,756 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:18:04,758 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:04,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 318 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 03:18:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2024-10-11 03:18:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.6124031007751938) internal successors, (416), 258 states have internal predecessors, (416), 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:18:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 416 transitions. [2024-10-11 03:18:04,787 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 416 transitions. Word has length 56 [2024-10-11 03:18:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:04,788 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 416 transitions. [2024-10-11 03:18:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:18:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 416 transitions. [2024-10-11 03:18:04,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:18:04,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:04,790 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] [2024-10-11 03:18:04,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:18:04,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:04,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1393501239, now seen corresponding path program 1 times [2024-10-11 03:18:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305186084] [2024-10-11 03:18:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,917 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:18:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305186084] [2024-10-11 03:18:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305186084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:04,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:04,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310125187] [2024-10-11 03:18:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:04,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:04,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:04,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:04,922 INFO L87 Difference]: Start difference. First operand 259 states and 416 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:18:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:04,963 INFO L93 Difference]: Finished difference Result 651 states and 1062 transitions. [2024-10-11 03:18:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2024-10-11 03:18:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:04,966 INFO L225 Difference]: With dead ends: 651 [2024-10-11 03:18:04,968 INFO L226 Difference]: Without dead ends: 441 [2024-10-11 03:18:04,971 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:18:04,971 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 78 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:04,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-11 03:18:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2024-10-11 03:18:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.6129032258064515) internal successors, (700), 434 states have internal predecessors, (700), 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:18:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 700 transitions. [2024-10-11 03:18:05,002 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 700 transitions. Word has length 58 [2024-10-11 03:18:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:05,002 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 700 transitions. [2024-10-11 03:18:05,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:18:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 700 transitions. [2024-10-11 03:18:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:18:05,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:05,004 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] [2024-10-11 03:18:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:18:05,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:05,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash -691140561, now seen corresponding path program 1 times [2024-10-11 03:18:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260497944] [2024-10-11 03:18:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:05,155 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:18:05,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260497944] [2024-10-11 03:18:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260497944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:05,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:18:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431917364] [2024-10-11 03:18:05,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:05,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:18:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:05,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:18:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:05,158 INFO L87 Difference]: Start difference. First operand 435 states and 700 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:18:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:05,354 INFO L93 Difference]: Finished difference Result 1863 states and 3090 transitions. [2024-10-11 03:18:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:18:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-10-11 03:18:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:05,364 INFO L225 Difference]: With dead ends: 1863 [2024-10-11 03:18:05,364 INFO L226 Difference]: Without dead ends: 1477 [2024-10-11 03:18:05,365 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:18:05,366 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 695 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:05,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 983 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-10-11 03:18:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 772. [2024-10-11 03:18:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.6264591439688716) internal successors, (1254), 771 states have internal predecessors, (1254), 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:18:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1254 transitions. [2024-10-11 03:18:05,414 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1254 transitions. Word has length 60 [2024-10-11 03:18:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:05,414 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1254 transitions. [2024-10-11 03:18:05,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:18:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1254 transitions. [2024-10-11 03:18:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:18:05,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:05,415 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:18:05,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:18:05,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:05,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -13242013, now seen corresponding path program 1 times [2024-10-11 03:18:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:05,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985463437] [2024-10-11 03:18:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:05,542 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:18:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985463437] [2024-10-11 03:18:05,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985463437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:18:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274606980] [2024-10-11 03:18:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:05,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:05,545 INFO L87 Difference]: Start difference. First operand 772 states and 1254 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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:18:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:05,643 INFO L93 Difference]: Finished difference Result 2257 states and 3733 transitions. [2024-10-11 03:18:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:18:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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:18:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:05,649 INFO L225 Difference]: With dead ends: 2257 [2024-10-11 03:18:05,649 INFO L226 Difference]: Without dead ends: 1534 [2024-10-11 03:18:05,651 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:18:05,651 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 305 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:05,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 560 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-10-11 03:18:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1144. [2024-10-11 03:18:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.636920384951881) internal successors, (1871), 1143 states have internal predecessors, (1871), 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:18:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1871 transitions. [2024-10-11 03:18:05,709 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1871 transitions. Word has length 61 [2024-10-11 03:18:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:05,710 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1871 transitions. [2024-10-11 03:18:05,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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:18:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1871 transitions. [2024-10-11 03:18:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:18:05,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:05,713 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] [2024-10-11 03:18:05,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:18:05,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:05,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash -467771752, now seen corresponding path program 1 times [2024-10-11 03:18:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:05,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229194492] [2024-10-11 03:18:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:05,813 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:18:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229194492] [2024-10-11 03:18:05,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229194492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:05,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:05,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:18:05,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514074969] [2024-10-11 03:18:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:05,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:05,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:05,816 INFO L87 Difference]: Start difference. First operand 1144 states and 1871 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:18:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:05,919 INFO L93 Difference]: Finished difference Result 3325 states and 5491 transitions. [2024-10-11 03:18:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:18:05,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-10-11 03:18:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:05,927 INFO L225 Difference]: With dead ends: 3325 [2024-10-11 03:18:05,928 INFO L226 Difference]: Without dead ends: 2230 [2024-10-11 03:18:05,929 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:18:05,931 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 305 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:05,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 520 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-10-11 03:18:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1675. [2024-10-11 03:18:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.6356033452807646) internal successors, (2738), 1674 states have internal predecessors, (2738), 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:18:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2738 transitions. [2024-10-11 03:18:05,986 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2738 transitions. Word has length 62 [2024-10-11 03:18:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:05,986 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2738 transitions. [2024-10-11 03:18:05,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:18:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2738 transitions. [2024-10-11 03:18:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:18:05,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:05,989 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:18:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:18:05,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash -883755154, now seen corresponding path program 1 times [2024-10-11 03:18:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127904675] [2024-10-11 03:18:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127904675] [2024-10-11 03:18:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127904675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:06,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:06,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035998776] [2024-10-11 03:18:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:06,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:06,080 INFO L87 Difference]: Start difference. First operand 1675 states and 2738 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:18:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:06,136 INFO L93 Difference]: Finished difference Result 3502 states and 5726 transitions. [2024-10-11 03:18:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:06,137 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:18:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:06,147 INFO L225 Difference]: With dead ends: 3502 [2024-10-11 03:18:06,147 INFO L226 Difference]: Without dead ends: 2520 [2024-10-11 03:18:06,149 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:18:06,151 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:06,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 363 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2024-10-11 03:18:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2518. [2024-10-11 03:18:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2517 states have (on average 1.6170043702820818) internal successors, (4070), 2517 states have internal predecessors, (4070), 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:18:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4070 transitions. [2024-10-11 03:18:06,217 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4070 transitions. Word has length 63 [2024-10-11 03:18:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:06,218 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4070 transitions. [2024-10-11 03:18:06,218 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:18:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4070 transitions. [2024-10-11 03:18:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:18:06,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:06,252 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:18:06,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:18:06,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:06,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1667840020, now seen corresponding path program 1 times [2024-10-11 03:18:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337642471] [2024-10-11 03:18:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:06,354 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:18:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:06,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337642471] [2024-10-11 03:18:06,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337642471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:06,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:06,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:18:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588614004] [2024-10-11 03:18:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:06,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:06,356 INFO L87 Difference]: Start difference. First operand 2518 states and 4070 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:18:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:06,494 INFO L93 Difference]: Finished difference Result 7596 states and 12391 transitions. [2024-10-11 03:18:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:18:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:18:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:06,514 INFO L225 Difference]: With dead ends: 7596 [2024-10-11 03:18:06,514 INFO L226 Difference]: Without dead ends: 5238 [2024-10-11 03:18:06,517 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:18:06,518 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 303 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:06,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 559 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2024-10-11 03:18:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 3862. [2024-10-11 03:18:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3861 states have (on average 1.615125615125615) internal successors, (6236), 3861 states have internal predecessors, (6236), 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:18:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 6236 transitions. [2024-10-11 03:18:06,651 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 6236 transitions. Word has length 63 [2024-10-11 03:18:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:06,651 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 6236 transitions. [2024-10-11 03:18:06,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:18:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 6236 transitions. [2024-10-11 03:18:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:18:06,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:06,652 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:18:06,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:18:06,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:06,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1705470815, now seen corresponding path program 1 times [2024-10-11 03:18:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789602427] [2024-10-11 03:18:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789602427] [2024-10-11 03:18:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789602427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709536426] [2024-10-11 03:18:06,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:06,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:06,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:06,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:06,745 INFO L87 Difference]: Start difference. First operand 3862 states and 6236 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:18:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:06,871 INFO L93 Difference]: Finished difference Result 8546 states and 13858 transitions. [2024-10-11 03:18:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:06,872 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:18:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:06,894 INFO L225 Difference]: With dead ends: 8546 [2024-10-11 03:18:06,894 INFO L226 Difference]: Without dead ends: 5803 [2024-10-11 03:18:06,900 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:18:06,901 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:06,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2024-10-11 03:18:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5801. [2024-10-11 03:18:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5801 states, 5800 states have (on average 1.6043103448275862) internal successors, (9305), 5800 states have internal predecessors, (9305), 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:18:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 9305 transitions. [2024-10-11 03:18:07,088 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 9305 transitions. Word has length 63 [2024-10-11 03:18:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:07,088 INFO L471 AbstractCegarLoop]: Abstraction has 5801 states and 9305 transitions. [2024-10-11 03:18:07,089 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:18:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 9305 transitions. [2024-10-11 03:18:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:18:07,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:07,090 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:18:07,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:18:07,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:07,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash 710370960, now seen corresponding path program 1 times [2024-10-11 03:18:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864577153] [2024-10-11 03:18:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:07,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,148 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:18:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864577153] [2024-10-11 03:18:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864577153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665012689] [2024-10-11 03:18:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:07,152 INFO L87 Difference]: Start difference. First operand 5801 states and 9305 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:18:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:07,349 INFO L93 Difference]: Finished difference Result 13147 states and 21344 transitions. [2024-10-11 03:18:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:07,350 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:18:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:07,386 INFO L225 Difference]: With dead ends: 13147 [2024-10-11 03:18:07,386 INFO L226 Difference]: Without dead ends: 8868 [2024-10-11 03:18:07,392 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:18:07,392 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 89 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:07,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 400 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-10-11 03:18:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 8866. [2024-10-11 03:18:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8866 states, 8865 states have (on average 1.5994359842075578) internal successors, (14179), 8865 states have internal predecessors, (14179), 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:18:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8866 states to 8866 states and 14179 transitions. [2024-10-11 03:18:07,641 INFO L78 Accepts]: Start accepts. Automaton has 8866 states and 14179 transitions. Word has length 63 [2024-10-11 03:18:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:07,641 INFO L471 AbstractCegarLoop]: Abstraction has 8866 states and 14179 transitions. [2024-10-11 03:18:07,642 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:18:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 8866 states and 14179 transitions. [2024-10-11 03:18:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:18:07,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:07,642 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:18:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:18:07,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:07,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2047190676, now seen corresponding path program 1 times [2024-10-11 03:18:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512145909] [2024-10-11 03:18:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,895 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:18:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512145909] [2024-10-11 03:18:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512145909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:18:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229651647] [2024-10-11 03:18:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:07,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:18:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:18:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:07,897 INFO L87 Difference]: Start difference. First operand 8866 states and 14179 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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:18:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:08,101 INFO L93 Difference]: Finished difference Result 17671 states and 28274 transitions. [2024-10-11 03:18:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:18:08,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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:18:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:08,121 INFO L225 Difference]: With dead ends: 17671 [2024-10-11 03:18:08,121 INFO L226 Difference]: Without dead ends: 8868 [2024-10-11 03:18:08,134 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:18:08,136 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 157 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:08,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 461 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-10-11 03:18:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 8866. [2024-10-11 03:18:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8866 states, 8865 states have (on average 1.585335589396503) internal successors, (14054), 8865 states have internal predecessors, (14054), 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:18:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8866 states to 8866 states and 14054 transitions. [2024-10-11 03:18:08,418 INFO L78 Accepts]: Start accepts. Automaton has 8866 states and 14054 transitions. Word has length 65 [2024-10-11 03:18:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 8866 states and 14054 transitions. [2024-10-11 03:18:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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:18:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 8866 states and 14054 transitions. [2024-10-11 03:18:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:18:08,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:08,419 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:18:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:18:08,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2143907659, now seen corresponding path program 1 times [2024-10-11 03:18:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829865219] [2024-10-11 03:18:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:08,597 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:18:08,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829865219] [2024-10-11 03:18:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829865219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:08,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:18:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102260496] [2024-10-11 03:18:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:08,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:18:08,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:18:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:08,599 INFO L87 Difference]: Start difference. First operand 8866 states and 14054 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:18:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:08,966 INFO L93 Difference]: Finished difference Result 25421 states and 40446 transitions. [2024-10-11 03:18:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:18:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:18:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:09,007 INFO L225 Difference]: With dead ends: 25421 [2024-10-11 03:18:09,007 INFO L226 Difference]: Without dead ends: 16618 [2024-10-11 03:18:09,022 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:18:09,023 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 153 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:09,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 465 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2024-10-11 03:18:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 16616. [2024-10-11 03:18:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16616 states, 16615 states have (on average 1.57008727053867) internal successors, (26087), 16615 states have internal predecessors, (26087), 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:18:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 26087 transitions. [2024-10-11 03:18:09,499 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 26087 transitions. Word has length 68 [2024-10-11 03:18:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:09,499 INFO L471 AbstractCegarLoop]: Abstraction has 16616 states and 26087 transitions. [2024-10-11 03:18:09,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:18:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 26087 transitions. [2024-10-11 03:18:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:18:09,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:09,500 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:18:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:18:09,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2051147253, now seen corresponding path program 1 times [2024-10-11 03:18:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999979457] [2024-10-11 03:18:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,769 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:18:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:09,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999979457] [2024-10-11 03:18:09,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999979457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:18:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551261613] [2024-10-11 03:18:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:09,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:09,771 INFO L87 Difference]: Start difference. First operand 16616 states and 26087 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:18:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:09,974 INFO L93 Difference]: Finished difference Result 17342 states and 27174 transitions. [2024-10-11 03:18:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:18:09,975 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:18:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:10,015 INFO L225 Difference]: With dead ends: 17342 [2024-10-11 03:18:10,016 INFO L226 Difference]: Without dead ends: 17340 [2024-10-11 03:18:10,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:18:10,028 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:10,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17340 states. [2024-10-11 03:18:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17340 to 17340. [2024-10-11 03:18:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17340 states, 17339 states have (on average 1.545763884883788) internal successors, (26802), 17339 states have internal predecessors, (26802), 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:18:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 26802 transitions. [2024-10-11 03:18:10,481 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 26802 transitions. Word has length 69 [2024-10-11 03:18:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 17340 states and 26802 transitions. [2024-10-11 03:18:10,481 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:18:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 26802 transitions. [2024-10-11 03:18:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:18:10,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:10,483 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] [2024-10-11 03:18:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:18:10,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -180411799, now seen corresponding path program 1 times [2024-10-11 03:18:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746874278] [2024-10-11 03:18:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:18:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746874278] [2024-10-11 03:18:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746874278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778844588] [2024-10-11 03:18:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:10,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:10,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:10,580 INFO L87 Difference]: Start difference. First operand 17340 states and 26802 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:18:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:11,064 INFO L93 Difference]: Finished difference Result 51777 states and 79958 transitions. [2024-10-11 03:18:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:11,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 95 [2024-10-11 03:18:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:11,138 INFO L225 Difference]: With dead ends: 51777 [2024-10-11 03:18:11,139 INFO L226 Difference]: Without dead ends: 34491 [2024-10-11 03:18:11,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:11,164 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 110 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:11,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 389 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34491 states. [2024-10-11 03:18:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34491 to 34489. [2024-10-11 03:18:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34489 states, 34488 states have (on average 1.5312282533054975) internal successors, (52809), 34488 states have internal predecessors, (52809), 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:18:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34489 states to 34489 states and 52809 transitions. [2024-10-11 03:18:12,300 INFO L78 Accepts]: Start accepts. Automaton has 34489 states and 52809 transitions. Word has length 95 [2024-10-11 03:18:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:12,304 INFO L471 AbstractCegarLoop]: Abstraction has 34489 states and 52809 transitions. [2024-10-11 03:18:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:18:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34489 states and 52809 transitions. [2024-10-11 03:18:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:18:12,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:12,309 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] [2024-10-11 03:18:12,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:18:12,309 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:12,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1886153126, now seen corresponding path program 1 times [2024-10-11 03:18:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313396828] [2024-10-11 03:18:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:18:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313396828] [2024-10-11 03:18:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313396828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:12,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:12,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:12,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074908639] [2024-10-11 03:18:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:12,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:12,398 INFO L87 Difference]: Start difference. First operand 34489 states and 52809 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:18:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:13,235 INFO L93 Difference]: Finished difference Result 102999 states and 157563 transitions. [2024-10-11 03:18:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 95 [2024-10-11 03:18:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:13,389 INFO L225 Difference]: With dead ends: 102999 [2024-10-11 03:18:13,389 INFO L226 Difference]: Without dead ends: 68600 [2024-10-11 03:18:13,427 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:18:13,429 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 96 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:13,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68600 states. [2024-10-11 03:18:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68600 to 68598. [2024-10-11 03:18:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68598 states, 68597 states have (on average 1.5165240462410892) internal successors, (104029), 68597 states have internal predecessors, (104029), 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:18:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68598 states to 68598 states and 104029 transitions. [2024-10-11 03:18:15,285 INFO L78 Accepts]: Start accepts. Automaton has 68598 states and 104029 transitions. Word has length 95 [2024-10-11 03:18:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:15,286 INFO L471 AbstractCegarLoop]: Abstraction has 68598 states and 104029 transitions. [2024-10-11 03:18:15,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:18:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 68598 states and 104029 transitions. [2024-10-11 03:18:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:18:15,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:15,290 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] [2024-10-11 03:18:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:18:15,290 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1413714315, now seen corresponding path program 1 times [2024-10-11 03:18:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315450125] [2024-10-11 03:18:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:15,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:15,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315450125] [2024-10-11 03:18:15,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315450125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:15,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:15,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879087646] [2024-10-11 03:18:15,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:15,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:15,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:15,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:15,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:15,369 INFO L87 Difference]: Start difference. First operand 68598 states and 104029 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:17,206 INFO L93 Difference]: Finished difference Result 204906 states and 310457 transitions. [2024-10-11 03:18:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:17,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-10-11 03:18:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:17,513 INFO L225 Difference]: With dead ends: 204906 [2024-10-11 03:18:17,513 INFO L226 Difference]: Without dead ends: 136480 [2024-10-11 03:18:17,596 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:18:17,597 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 111 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:17,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 388 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136480 states. [2024-10-11 03:18:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136480 to 136478. [2024-10-11 03:18:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136478 states, 136477 states have (on average 1.5017255654798978) internal successors, (204951), 136477 states have internal predecessors, (204951), 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:18:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136478 states to 136478 states and 204951 transitions. [2024-10-11 03:18:20,731 INFO L78 Accepts]: Start accepts. Automaton has 136478 states and 204951 transitions. Word has length 95 [2024-10-11 03:18:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:20,732 INFO L471 AbstractCegarLoop]: Abstraction has 136478 states and 204951 transitions. [2024-10-11 03:18:20,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 136478 states and 204951 transitions. [2024-10-11 03:18:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:18:20,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:20,742 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:18:20,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:18:20,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1398195597, now seen corresponding path program 1 times [2024-10-11 03:18:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984600755] [2024-10-11 03:18:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:20,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984600755] [2024-10-11 03:18:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984600755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796898277] [2024-10-11 03:18:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:20,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:20,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:20,837 INFO L87 Difference]: Start difference. First operand 136478 states and 204951 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:24,783 INFO L93 Difference]: Finished difference Result 407686 states and 611662 transitions. [2024-10-11 03:18:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:24,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-10-11 03:18:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:25,328 INFO L225 Difference]: With dead ends: 407686 [2024-10-11 03:18:25,329 INFO L226 Difference]: Without dead ends: 271560 [2024-10-11 03:18:25,405 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:18:25,406 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:25,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271560 states. [2024-10-11 03:18:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271560 to 271558. [2024-10-11 03:18:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271558 states, 271557 states have (on average 1.4868333351745675) internal successors, (403760), 271557 states have internal predecessors, (403760), 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:18:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271558 states to 271558 states and 403760 transitions. [2024-10-11 03:18:32,145 INFO L78 Accepts]: Start accepts. Automaton has 271558 states and 403760 transitions. Word has length 95 [2024-10-11 03:18:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:32,145 INFO L471 AbstractCegarLoop]: Abstraction has 271558 states and 403760 transitions. [2024-10-11 03:18:32,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 271558 states and 403760 transitions. [2024-10-11 03:18:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:18:32,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:32,161 INFO L215 NwaCegarLoop]: trace histogram [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:18:32,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:18:32,161 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:32,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash 500802319, now seen corresponding path program 1 times [2024-10-11 03:18:32,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:32,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301494269] [2024-10-11 03:18:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301494269] [2024-10-11 03:18:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301494269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550524104] [2024-10-11 03:18:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:32,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:32,248 INFO L87 Difference]: Start difference. First operand 271558 states and 403760 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:36,277 INFO L93 Difference]: Finished difference Result 408014 states and 605322 transitions. [2024-10-11 03:18:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:36,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-10-11 03:18:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:36,864 INFO L225 Difference]: With dead ends: 408014 [2024-10-11 03:18:36,864 INFO L226 Difference]: Without dead ends: 271856 [2024-10-11 03:18:36,991 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:18:36,992 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 101 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:36,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 442 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271856 states. [2024-10-11 03:18:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271856 to 271854. [2024-10-11 03:18:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271854 states, 271853 states have (on average 1.474046635497861) internal successors, (400724), 271853 states have internal predecessors, (400724), 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:18:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271854 states to 271854 states and 400724 transitions. [2024-10-11 03:18:43,562 INFO L78 Accepts]: Start accepts. Automaton has 271854 states and 400724 transitions. Word has length 95 [2024-10-11 03:18:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:43,563 INFO L471 AbstractCegarLoop]: Abstraction has 271854 states and 400724 transitions. [2024-10-11 03:18:43,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 271854 states and 400724 transitions. [2024-10-11 03:18:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:18:43,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:43,578 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:18:43,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:18:43,578 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:43,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:43,579 INFO L85 PathProgramCache]: Analyzing trace with hash -510314931, now seen corresponding path program 1 times [2024-10-11 03:18:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:43,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011485380] [2024-10-11 03:18:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:18:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011485380] [2024-10-11 03:18:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011485380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:18:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422295167] [2024-10-11 03:18:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:18:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:18:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:18:43,650 INFO L87 Difference]: Start difference. First operand 271854 states and 400724 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:18:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:47,444 INFO L93 Difference]: Finished difference Result 408486 states and 600809 transitions. [2024-10-11 03:18:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:18:47,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-10-11 03:18:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:48,389 INFO L225 Difference]: With dead ends: 408486 [2024-10-11 03:18:48,389 INFO L226 Difference]: Without dead ends: 272360 [2024-10-11 03:18:48,512 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:18:48,514 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 115 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:48,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 460 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272360 states.