./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:01:35,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:01:35,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:01:35,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:01:35,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:01:35,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:01:35,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:01:35,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:01:35,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:01:35,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:01:35,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:01:35,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:01:35,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:01:35,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:01:35,261 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:01:35,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:01:35,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:01:35,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:01:35,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:01:35,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:01:35,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:01:35,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:01:35,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:01:35,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:01:35,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:01:35,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:01:35,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:01:35,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:01:35,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:01:35,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:01:35,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:01:35,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:01:35,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:01:35,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:01:35,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:01:35,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:01:35,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:01:35,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:01:35,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:01:35,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:01:35,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:01:35,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:01:35,274 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d [2024-10-14 04:01:35,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:01:35,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:01:35,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:01:35,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:01:35,576 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:01:35,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:01:37,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:01:37,274 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:01:37,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:01:37,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610702b21/6a03b51151ea4fc1af11d9320c85403e/FLAG47fdb9506 [2024-10-14 04:01:37,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610702b21/6a03b51151ea4fc1af11d9320c85403e [2024-10-14 04:01:37,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:01:37,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:01:37,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:01:37,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:01:37,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:01:37,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:01:37" (1/1) ... [2024-10-14 04:01:37,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a8518a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:37, skipping insertion in model container [2024-10-14 04:01:37,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:01:37" (1/1) ... [2024-10-14 04:01:37,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:01:37,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2024-10-14 04:01:37,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:01:38,002 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:01:38,090 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2024-10-14 04:01:38,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:01:38,136 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:01:38,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38 WrapperNode [2024-10-14 04:01:38,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:01:38,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:01:38,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:01:38,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:01:38,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,202 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 716 [2024-10-14 04:01:38,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:01:38,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:01:38,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:01:38,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:01:38,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,244 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-14 04:01:38,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:01:38,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:01:38,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:01:38,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:01:38,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (1/1) ... [2024-10-14 04:01:38,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:01:38,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:01:38,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:01:38,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:01:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:01:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:01:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:01:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:01:38,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:01:38,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:01:39,200 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-14 04:01:39,200 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:01:39,249 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:01:39,249 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 04:01:39,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:01:39 BoogieIcfgContainer [2024-10-14 04:01:39,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:01:39,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:01:39,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:01:39,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:01:39,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:01:37" (1/3) ... [2024-10-14 04:01:39,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2795b642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:01:39, skipping insertion in model container [2024-10-14 04:01:39,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:01:38" (2/3) ... [2024-10-14 04:01:39,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2795b642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:01:39, skipping insertion in model container [2024-10-14 04:01:39,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:01:39" (3/3) ... [2024-10-14 04:01:39,257 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:01:39,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:01:39,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 04:01:39,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:01:39,358 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;@67b95a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:01:39,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 04:01:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 155 states have (on average 1.761290322580645) internal successors, (273), 156 states have internal predecessors, (273), 0 states have call successors, (0), 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-14 04:01:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:01:39,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:39,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:39,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1079152141, now seen corresponding path program 1 times [2024-10-14 04:01:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441296108] [2024-10-14 04:01:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:40,057 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-14 04:01:40,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441296108] [2024-10-14 04:01:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441296108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:40,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321756890] [2024-10-14 04:01:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:40,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:40,089 INFO L87 Difference]: Start difference. First operand has 157 states, 155 states have (on average 1.761290322580645) internal successors, (273), 156 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:40,173 INFO L93 Difference]: Finished difference Result 337 states and 556 transitions. [2024-10-14 04:01:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-14 04:01:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:40,190 INFO L225 Difference]: With dead ends: 337 [2024-10-14 04:01:40,191 INFO L226 Difference]: Without dead ends: 239 [2024-10-14 04:01:40,194 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-14 04:01:40,198 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 185 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 533 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-14 04:01:40,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 533 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-14 04:01:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2024-10-14 04:01:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.4406779661016949) internal successors, (340), 236 states have internal predecessors, (340), 0 states have call successors, (0), 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-14 04:01:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 340 transitions. [2024-10-14 04:01:40,260 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 340 transitions. Word has length 101 [2024-10-14 04:01:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:40,261 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 340 transitions. [2024-10-14 04:01:40,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 340 transitions. [2024-10-14 04:01:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 04:01:40,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:40,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:40,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:01:40,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:40,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1195322511, now seen corresponding path program 1 times [2024-10-14 04:01:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38483607] [2024-10-14 04:01:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:40,471 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-14 04:01:40,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:40,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38483607] [2024-10-14 04:01:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38483607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:40,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333801285] [2024-10-14 04:01:40,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:40,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:40,477 INFO L87 Difference]: Start difference. First operand 237 states and 340 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:40,515 INFO L93 Difference]: Finished difference Result 569 states and 868 transitions. [2024-10-14 04:01:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-14 04:01:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:40,519 INFO L225 Difference]: With dead ends: 569 [2024-10-14 04:01:40,519 INFO L226 Difference]: Without dead ends: 395 [2024-10-14 04:01:40,520 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-14 04:01:40,521 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 126 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:40,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 459 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-14 04:01:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-10-14 04:01:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5) internal successors, (588), 392 states have internal predecessors, (588), 0 states have call successors, (0), 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-14 04:01:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 588 transitions. [2024-10-14 04:01:40,541 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 588 transitions. Word has length 102 [2024-10-14 04:01:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:40,542 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 588 transitions. [2024-10-14 04:01:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 588 transitions. [2024-10-14 04:01:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 04:01:40,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:40,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:40,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:01:40,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:40,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1086033565, now seen corresponding path program 1 times [2024-10-14 04:01:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:40,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313404371] [2024-10-14 04:01:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:40,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:40,729 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-14 04:01:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313404371] [2024-10-14 04:01:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313404371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:40,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:40,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192391758] [2024-10-14 04:01:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:40,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:40,735 INFO L87 Difference]: Start difference. First operand 393 states and 588 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 04:01:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:40,766 INFO L93 Difference]: Finished difference Result 1021 states and 1586 transitions. [2024-10-14 04:01:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-14 04:01:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:40,772 INFO L225 Difference]: With dead ends: 1021 [2024-10-14 04:01:40,772 INFO L226 Difference]: Without dead ends: 691 [2024-10-14 04:01:40,774 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-14 04:01:40,778 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 121 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:40,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 455 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-14 04:01:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2024-10-14 04:01:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.5348837209302326) internal successors, (1056), 688 states have internal predecessors, (1056), 0 states have call successors, (0), 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-14 04:01:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1056 transitions. [2024-10-14 04:01:40,823 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1056 transitions. Word has length 103 [2024-10-14 04:01:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1056 transitions. [2024-10-14 04:01:40,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 04:01:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1056 transitions. [2024-10-14 04:01:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 04:01:40,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:40,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:01:40,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash 319867899, now seen corresponding path program 1 times [2024-10-14 04:01:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940348944] [2024-10-14 04:01:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:40,993 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-14 04:01:40,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940348944] [2024-10-14 04:01:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940348944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:40,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:40,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526914759] [2024-10-14 04:01:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:41,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:41,001 INFO L87 Difference]: Start difference. First operand 689 states and 1056 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:41,034 INFO L93 Difference]: Finished difference Result 1877 states and 2938 transitions. [2024-10-14 04:01:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:41,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-14 04:01:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:41,043 INFO L225 Difference]: With dead ends: 1877 [2024-10-14 04:01:41,043 INFO L226 Difference]: Without dead ends: 1251 [2024-10-14 04:01:41,044 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-14 04:01:41,048 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 116 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:41,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 451 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-10-14 04:01:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2024-10-14 04:01:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.5512820512820513) internal successors, (1936), 1248 states have internal predecessors, (1936), 0 states have call successors, (0), 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-14 04:01:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1936 transitions. [2024-10-14 04:01:41,085 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1936 transitions. Word has length 104 [2024-10-14 04:01:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:41,086 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1936 transitions. [2024-10-14 04:01:41,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1936 transitions. [2024-10-14 04:01:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 04:01:41,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:41,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:41,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:01:41,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:41,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:41,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1176147823, now seen corresponding path program 1 times [2024-10-14 04:01:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553699127] [2024-10-14 04:01:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:41,233 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-14 04:01:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553699127] [2024-10-14 04:01:41,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553699127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:41,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574588317] [2024-10-14 04:01:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:41,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:41,239 INFO L87 Difference]: Start difference. First operand 1249 states and 1936 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-14 04:01:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:41,274 INFO L93 Difference]: Finished difference Result 3493 states and 5474 transitions. [2024-10-14 04:01:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-14 04:01:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:41,284 INFO L225 Difference]: With dead ends: 3493 [2024-10-14 04:01:41,284 INFO L226 Difference]: Without dead ends: 2307 [2024-10-14 04:01:41,286 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-14 04:01:41,288 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 111 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:41,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2024-10-14 04:01:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2305. [2024-10-14 04:01:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 1.5555555555555556) internal successors, (3584), 2304 states have internal predecessors, (3584), 0 states have call successors, (0), 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-14 04:01:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3584 transitions. [2024-10-14 04:01:41,339 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3584 transitions. Word has length 105 [2024-10-14 04:01:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:41,340 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 3584 transitions. [2024-10-14 04:01:41,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-14 04:01:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3584 transitions. [2024-10-14 04:01:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 04:01:41,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:41,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:41,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:01:41,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:41,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -611746598, now seen corresponding path program 1 times [2024-10-14 04:01:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130582143] [2024-10-14 04:01:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:41,454 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-14 04:01:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130582143] [2024-10-14 04:01:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130582143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:41,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235236987] [2024-10-14 04:01:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:41,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:41,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:41,458 INFO L87 Difference]: Start difference. First operand 2305 states and 3584 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:41,507 INFO L93 Difference]: Finished difference Result 6533 states and 10210 transitions. [2024-10-14 04:01:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:41,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-14 04:01:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:41,526 INFO L225 Difference]: With dead ends: 6533 [2024-10-14 04:01:41,526 INFO L226 Difference]: Without dead ends: 4291 [2024-10-14 04:01:41,531 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-14 04:01:41,533 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 106 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:41,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2024-10-14 04:01:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4289. [2024-10-14 04:01:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 4288 states have (on average 1.5522388059701493) internal successors, (6656), 4288 states have internal predecessors, (6656), 0 states have call successors, (0), 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-14 04:01:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6656 transitions. [2024-10-14 04:01:41,649 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6656 transitions. Word has length 106 [2024-10-14 04:01:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:41,649 INFO L471 AbstractCegarLoop]: Abstraction has 4289 states and 6656 transitions. [2024-10-14 04:01:41,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:01:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6656 transitions. [2024-10-14 04:01:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 04:01:41,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:41,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:41,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:01:41,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:41,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1150505180, now seen corresponding path program 1 times [2024-10-14 04:01:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710389099] [2024-10-14 04:01:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:41,776 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-14 04:01:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710389099] [2024-10-14 04:01:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710389099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:41,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607207705] [2024-10-14 04:01:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:41,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:41,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:41,780 INFO L87 Difference]: Start difference. First operand 4289 states and 6656 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 04:01:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:41,844 INFO L93 Difference]: Finished difference Result 12229 states and 19010 transitions. [2024-10-14 04:01:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-14 04:01:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:41,872 INFO L225 Difference]: With dead ends: 12229 [2024-10-14 04:01:41,873 INFO L226 Difference]: Without dead ends: 8003 [2024-10-14 04:01:41,880 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-14 04:01:41,881 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:41,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 439 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2024-10-14 04:01:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 8001. [2024-10-14 04:01:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 1.544) internal successors, (12352), 8000 states have internal predecessors, (12352), 0 states have call successors, (0), 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-14 04:01:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 12352 transitions. [2024-10-14 04:01:42,093 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 12352 transitions. Word has length 107 [2024-10-14 04:01:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:42,093 INFO L471 AbstractCegarLoop]: Abstraction has 8001 states and 12352 transitions. [2024-10-14 04:01:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 04:01:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 12352 transitions. [2024-10-14 04:01:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 04:01:42,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:42,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:01:42,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash -82138799, now seen corresponding path program 1 times [2024-10-14 04:01:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:42,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266312708] [2024-10-14 04:01:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:42,433 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-14 04:01:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266312708] [2024-10-14 04:01:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266312708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:42,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:42,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 04:01:42,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039987550] [2024-10-14 04:01:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 04:01:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:42,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 04:01:42,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:01:42,436 INFO L87 Difference]: Start difference. First operand 8001 states and 12352 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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-14 04:01:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:43,811 INFO L93 Difference]: Finished difference Result 135009 states and 208976 transitions. [2024-10-14 04:01:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 04:01:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-14 04:01:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:44,212 INFO L225 Difference]: With dead ends: 135009 [2024-10-14 04:01:44,213 INFO L226 Difference]: Without dead ends: 127071 [2024-10-14 04:01:44,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-14 04:01:44,289 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 3201 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 7654 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:44,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3201 Valid, 7654 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 04:01:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127071 states. [2024-10-14 04:01:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127071 to 15937. [2024-10-14 04:01:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15937 states, 15936 states have (on average 1.5301204819277108) internal successors, (24384), 15936 states have internal predecessors, (24384), 0 states have call successors, (0), 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-14 04:01:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15937 states to 15937 states and 24384 transitions. [2024-10-14 04:01:45,679 INFO L78 Accepts]: Start accepts. Automaton has 15937 states and 24384 transitions. Word has length 108 [2024-10-14 04:01:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:45,680 INFO L471 AbstractCegarLoop]: Abstraction has 15937 states and 24384 transitions. [2024-10-14 04:01:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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-14 04:01:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 15937 states and 24384 transitions. [2024-10-14 04:01:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 04:01:45,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:45,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:01:45,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:45,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1747176077, now seen corresponding path program 1 times [2024-10-14 04:01:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795710328] [2024-10-14 04:01:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:45,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-14 04:01:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795710328] [2024-10-14 04:01:45,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795710328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:45,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920074087] [2024-10-14 04:01:45,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:45,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:45,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:45,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:45,817 INFO L87 Difference]: Start difference. First operand 15937 states and 24384 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-14 04:01:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:45,948 INFO L93 Difference]: Finished difference Result 46277 states and 70594 transitions. [2024-10-14 04:01:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:45,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-14 04:01:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:45,996 INFO L225 Difference]: With dead ends: 46277 [2024-10-14 04:01:45,996 INFO L226 Difference]: Without dead ends: 30403 [2024-10-14 04:01:46,019 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-14 04:01:46,021 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 345 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-14 04:01:46,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 345 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30403 states. [2024-10-14 04:01:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30403 to 30145. [2024-10-14 04:01:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.505307855626327) internal successors, (45376), 30144 states have internal predecessors, (45376), 0 states have call successors, (0), 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-14 04:01:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 45376 transitions. [2024-10-14 04:01:46,790 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 45376 transitions. Word has length 110 [2024-10-14 04:01:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:46,790 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 45376 transitions. [2024-10-14 04:01:46,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-14 04:01:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 45376 transitions. [2024-10-14 04:01:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 04:01:46,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:46,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:46,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:01:46,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:46,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1768178732, now seen corresponding path program 1 times [2024-10-14 04:01:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:46,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108550149] [2024-10-14 04:01:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:46,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:47,524 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-14 04:01:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108550149] [2024-10-14 04:01:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108550149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 04:01:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285924099] [2024-10-14 04:01:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 04:01:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 04:01:47,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:01:47,527 INFO L87 Difference]: Start difference. First operand 30145 states and 45376 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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-14 04:01:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:48,278 INFO L93 Difference]: Finished difference Result 60229 states and 90690 transitions. [2024-10-14 04:01:48,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:01:48,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-14 04:01:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:48,323 INFO L225 Difference]: With dead ends: 60229 [2024-10-14 04:01:48,324 INFO L226 Difference]: Without dead ends: 30147 [2024-10-14 04:01:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:01:48,351 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 176 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:48,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1354 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:01:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30147 states. [2024-10-14 04:01:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30147 to 30145. [2024-10-14 04:01:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.4968152866242037) internal successors, (45120), 30144 states have internal predecessors, (45120), 0 states have call successors, (0), 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-14 04:01:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 45120 transitions. [2024-10-14 04:01:48,863 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 45120 transitions. Word has length 110 [2024-10-14 04:01:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:48,863 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 45120 transitions. [2024-10-14 04:01:48,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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-14 04:01:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 45120 transitions. [2024-10-14 04:01:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:01:48,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:48,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:48,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:01:48,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:48,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1312772968, now seen corresponding path program 1 times [2024-10-14 04:01:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857966141] [2024-10-14 04:01:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:48,975 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-14 04:01:48,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857966141] [2024-10-14 04:01:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857966141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:48,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:01:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502313778] [2024-10-14 04:01:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:48,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:01:48,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:01:48,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:01:48,977 INFO L87 Difference]: Start difference. First operand 30145 states and 45120 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:49,126 INFO L93 Difference]: Finished difference Result 59336 states and 89414 transitions. [2024-10-14 04:01:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:01:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:01:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:49,369 INFO L225 Difference]: With dead ends: 59336 [2024-10-14 04:01:49,369 INFO L226 Difference]: Without dead ends: 43461 [2024-10-14 04:01:49,379 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-14 04:01:49,380 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 133 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:49,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 471 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:01:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43461 states. [2024-10-14 04:01:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43461 to 43459. [2024-10-14 04:01:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43459 states, 43458 states have (on average 1.4948225873256937) internal successors, (64962), 43458 states have internal predecessors, (64962), 0 states have call successors, (0), 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-14 04:01:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43459 states to 43459 states and 64962 transitions. [2024-10-14 04:01:50,217 INFO L78 Accepts]: Start accepts. Automaton has 43459 states and 64962 transitions. Word has length 111 [2024-10-14 04:01:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 43459 states and 64962 transitions. [2024-10-14 04:01:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 43459 states and 64962 transitions. [2024-10-14 04:01:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:01:50,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:50,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:50,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:01:50,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:50,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1022943379, now seen corresponding path program 1 times [2024-10-14 04:01:50,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:50,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566091917] [2024-10-14 04:01:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:50,529 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-14 04:01:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566091917] [2024-10-14 04:01:50,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566091917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:50,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:50,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:01:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796872798] [2024-10-14 04:01:50,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:50,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:01:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:01:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:01:50,532 INFO L87 Difference]: Start difference. First operand 43459 states and 64962 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:50,824 INFO L93 Difference]: Finished difference Result 86853 states and 129859 transitions. [2024-10-14 04:01:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:01:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:01:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:50,890 INFO L225 Difference]: With dead ends: 86853 [2024-10-14 04:01:50,890 INFO L226 Difference]: Without dead ends: 43459 [2024-10-14 04:01:50,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:01:50,929 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 526 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:50,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 150 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:01:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43459 states. [2024-10-14 04:01:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43459 to 43459. [2024-10-14 04:01:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43459 states, 43458 states have (on average 1.485986469694878) internal successors, (64578), 43458 states have internal predecessors, (64578), 0 states have call successors, (0), 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-14 04:01:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43459 states to 43459 states and 64578 transitions. [2024-10-14 04:01:51,763 INFO L78 Accepts]: Start accepts. Automaton has 43459 states and 64578 transitions. Word has length 111 [2024-10-14 04:01:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 43459 states and 64578 transitions. [2024-10-14 04:01:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43459 states and 64578 transitions. [2024-10-14 04:01:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:01:51,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:51,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:51,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:01:51,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:51,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1530606802, now seen corresponding path program 1 times [2024-10-14 04:01:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:51,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464488724] [2024-10-14 04:01:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:51,893 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-14 04:01:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:51,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464488724] [2024-10-14 04:01:51,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464488724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:51,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:51,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:01:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071767382] [2024-10-14 04:01:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:51,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:01:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:01:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:01:51,897 INFO L87 Difference]: Start difference. First operand 43459 states and 64578 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:52,554 INFO L93 Difference]: Finished difference Result 116039 states and 172868 transitions. [2024-10-14 04:01:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:01:52,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:01:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:52,660 INFO L225 Difference]: With dead ends: 116039 [2024-10-14 04:01:52,661 INFO L226 Difference]: Without dead ends: 72645 [2024-10-14 04:01:52,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:01:52,713 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 838 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:52,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 211 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:01:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72645 states. [2024-10-14 04:01:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72645 to 72643. [2024-10-14 04:01:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4845681561631012) internal successors, (107842), 72642 states have internal predecessors, (107842), 0 states have call successors, (0), 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-14 04:01:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 107842 transitions. [2024-10-14 04:01:53,909 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 107842 transitions. Word has length 111 [2024-10-14 04:01:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 107842 transitions. [2024-10-14 04:01:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 107842 transitions. [2024-10-14 04:01:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:01:53,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:53,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:01:53,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1017933833, now seen corresponding path program 1 times [2024-10-14 04:01:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608922582] [2024-10-14 04:01:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:54,471 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-14 04:01:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608922582] [2024-10-14 04:01:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608922582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:01:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488668039] [2024-10-14 04:01:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:54,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:01:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:01:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:01:54,473 INFO L87 Difference]: Start difference. First operand 72643 states and 107842 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:54,902 INFO L93 Difference]: Finished difference Result 145221 states and 215619 transitions. [2024-10-14 04:01:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:01:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:01:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:54,988 INFO L225 Difference]: With dead ends: 145221 [2024-10-14 04:01:54,988 INFO L226 Difference]: Without dead ends: 72643 [2024-10-14 04:01:55,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:01:55,046 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 484 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:55,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 174 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:01:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-14 04:01:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-14 04:01:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4757578260510449) internal successors, (107202), 72642 states have internal predecessors, (107202), 0 states have call successors, (0), 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-14 04:01:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 107202 transitions. [2024-10-14 04:01:56,531 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 107202 transitions. Word has length 111 [2024-10-14 04:01:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:56,531 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 107202 transitions. [2024-10-14 04:01:56,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 107202 transitions. [2024-10-14 04:01:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:01:56,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:56,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:56,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:01:56,533 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -889848526, now seen corresponding path program 1 times [2024-10-14 04:01:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725030634] [2024-10-14 04:01:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:56,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:56,684 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-14 04:01:56,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:56,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725030634] [2024-10-14 04:01:56,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725030634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:56,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:56,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:01:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241921833] [2024-10-14 04:01:56,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:56,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:01:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:01:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:01:56,688 INFO L87 Difference]: Start difference. First operand 72643 states and 107202 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:57,213 INFO L93 Difference]: Finished difference Result 145221 states and 214339 transitions. [2024-10-14 04:01:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:01:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:01:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:57,302 INFO L225 Difference]: With dead ends: 145221 [2024-10-14 04:01:57,302 INFO L226 Difference]: Without dead ends: 72643 [2024-10-14 04:01:57,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:01:57,356 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 494 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:57,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 166 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:01:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-14 04:01:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-14 04:01:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4669474959389885) internal successors, (106562), 72642 states have internal predecessors, (106562), 0 states have call successors, (0), 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-14 04:01:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 106562 transitions. [2024-10-14 04:01:58,601 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 106562 transitions. Word has length 111 [2024-10-14 04:01:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:01:58,601 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 106562 transitions. [2024-10-14 04:01:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 106562 transitions. [2024-10-14 04:01:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:01:58,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:01:58,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:01:58,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 04:01:58,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:01:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:01:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1652712233, now seen corresponding path program 1 times [2024-10-14 04:01:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:01:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302276655] [2024-10-14 04:01:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:01:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:01:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:01:58,751 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-14 04:01:58,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:01:58,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302276655] [2024-10-14 04:01:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302276655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:01:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:01:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:01:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604025733] [2024-10-14 04:01:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:01:58,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:01:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:01:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:01:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:01:58,753 INFO L87 Difference]: Start difference. First operand 72643 states and 106562 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:01:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:01:59,672 INFO L93 Difference]: Finished difference Result 145221 states and 213059 transitions. [2024-10-14 04:01:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:01:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:01:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:01:59,759 INFO L225 Difference]: With dead ends: 145221 [2024-10-14 04:01:59,760 INFO L226 Difference]: Without dead ends: 72643 [2024-10-14 04:01:59,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:01:59,806 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 465 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:01:59,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 182 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:01:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-14 04:02:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-14 04:02:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.458137165826932) internal successors, (105922), 72642 states have internal predecessors, (105922), 0 states have call successors, (0), 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-14 04:02:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 105922 transitions. [2024-10-14 04:02:00,823 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 105922 transitions. Word has length 111 [2024-10-14 04:02:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:02:00,823 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 105922 transitions. [2024-10-14 04:02:00,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:02:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 105922 transitions. [2024-10-14 04:02:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:02:00,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:02:00,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:02:00,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:02:00,824 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:02:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:02:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -787179844, now seen corresponding path program 1 times [2024-10-14 04:02:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:02:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441507316] [2024-10-14 04:02:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:02:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:02:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:02:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:02:00,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:02:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441507316] [2024-10-14 04:02:00,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441507316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:02:00,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:02:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:02:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542328763] [2024-10-14 04:02:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:02:00,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:02:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:02:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:02:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:02:00,950 INFO L87 Difference]: Start difference. First operand 72643 states and 105922 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:02:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:02:01,355 INFO L93 Difference]: Finished difference Result 145221 states and 211779 transitions. [2024-10-14 04:02:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:02:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:02:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:02:01,436 INFO L225 Difference]: With dead ends: 145221 [2024-10-14 04:02:01,436 INFO L226 Difference]: Without dead ends: 72643 [2024-10-14 04:02:01,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:02:01,485 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 449 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:02:01,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 190 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:02:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-14 04:02:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-14 04:02:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4493268357148756) internal successors, (105282), 72642 states have internal predecessors, (105282), 0 states have call successors, (0), 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-14 04:02:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 105282 transitions. [2024-10-14 04:02:03,124 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 105282 transitions. Word has length 111 [2024-10-14 04:02:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:02:03,125 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 105282 transitions. [2024-10-14 04:02:03,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:02:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 105282 transitions. [2024-10-14 04:02:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:02:03,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:02:03,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:02:03,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 04:02:03,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:02:03,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:02:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1316470345, now seen corresponding path program 1 times [2024-10-14 04:02:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:02:03,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181075619] [2024-10-14 04:02:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:02:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:02:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:02:03,984 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-14 04:02:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:02:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181075619] [2024-10-14 04:02:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181075619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:02:03,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:02:03,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:02:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535451491] [2024-10-14 04:02:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:02:03,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:02:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:02:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:02:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:02:03,986 INFO L87 Difference]: Start difference. First operand 72643 states and 105282 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:02:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:02:04,222 INFO L93 Difference]: Finished difference Result 74693 states and 108355 transitions. [2024-10-14 04:02:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:02:04,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 04:02:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:02:04,339 INFO L225 Difference]: With dead ends: 74693 [2024-10-14 04:02:04,339 INFO L226 Difference]: Without dead ends: 74691 [2024-10-14 04:02:04,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:02:04,372 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:02:04,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 792 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:02:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74691 states. [2024-10-14 04:02:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74691 to 74691. [2024-10-14 04:02:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74691 states, 74690 states have (on average 1.4352925425090373) internal successors, (107202), 74690 states have internal predecessors, (107202), 0 states have call successors, (0), 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-14 04:02:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74691 states to 74691 states and 107202 transitions. [2024-10-14 04:02:05,465 INFO L78 Accepts]: Start accepts. Automaton has 74691 states and 107202 transitions. Word has length 111 [2024-10-14 04:02:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:02:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 74691 states and 107202 transitions. [2024-10-14 04:02:05,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 04:02:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 74691 states and 107202 transitions. [2024-10-14 04:02:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 04:02:05,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:02:05,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:02:05,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 04:02:05,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:02:05,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:02:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 615396721, now seen corresponding path program 1 times [2024-10-14 04:02:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:02:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952602690] [2024-10-14 04:02:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:02:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:02:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:02:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 04:02:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:02:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952602690] [2024-10-14 04:02:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952602690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:02:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:02:05,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 04:02:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188242564] [2024-10-14 04:02:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:02:05,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 04:02:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:02:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 04:02:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:02:05,776 INFO L87 Difference]: Start difference. First operand 74691 states and 107202 transitions. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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-14 04:02:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:02:07,824 INFO L93 Difference]: Finished difference Result 694869 states and 997131 transitions. [2024-10-14 04:02:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:02:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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 150 [2024-10-14 04:02:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:02:09,647 INFO L225 Difference]: With dead ends: 694869 [2024-10-14 04:02:09,647 INFO L226 Difference]: Without dead ends: 620243 [2024-10-14 04:02:09,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:02:09,764 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 2767 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:02:09,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 2933 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:02:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620243 states. [2024-10-14 04:02:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620243 to 149315. [2024-10-14 04:02:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149315 states, 149314 states have (on average 1.4311986819722196) internal successors, (213698), 149314 states have internal predecessors, (213698), 0 states have call successors, (0), 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-14 04:02:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149315 states to 149315 states and 213698 transitions. [2024-10-14 04:02:14,810 INFO L78 Accepts]: Start accepts. Automaton has 149315 states and 213698 transitions. Word has length 150 [2024-10-14 04:02:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:02:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 149315 states and 213698 transitions. [2024-10-14 04:02:14,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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-14 04:02:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 149315 states and 213698 transitions. [2024-10-14 04:02:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 04:02:14,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:02:14,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:02:14,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 04:02:14,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:02:14,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:02:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1682316791, now seen corresponding path program 1 times [2024-10-14 04:02:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:02:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463431776] [2024-10-14 04:02:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:02:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:02:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:02:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 04:02:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:02:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463431776] [2024-10-14 04:02:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463431776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:02:15,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:02:15,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 04:02:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981781798] [2024-10-14 04:02:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:02:15,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 04:02:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:02:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 04:02:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:02:15,119 INFO L87 Difference]: Start difference. First operand 149315 states and 213698 transitions. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 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-14 04:02:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:02:18,997 INFO L93 Difference]: Finished difference Result 769493 states and 1103627 transitions. [2024-10-14 04:02:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:02:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 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 150 [2024-10-14 04:02:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:02:20,396 INFO L225 Difference]: With dead ends: 769493 [2024-10-14 04:02:20,397 INFO L226 Difference]: Without dead ends: 694867 [2024-10-14 04:02:20,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:02:20,594 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 2803 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:02:20,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2803 Valid, 2662 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:02:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694867 states. [2024-10-14 04:02:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694867 to 261315. [2024-10-14 04:02:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261315 states, 261314 states have (on average 1.4268887239106975) internal successors, (372866), 261314 states have internal predecessors, (372866), 0 states have call successors, (0), 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-14 04:02:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261315 states to 261315 states and 372866 transitions. [2024-10-14 04:02:27,811 INFO L78 Accepts]: Start accepts. Automaton has 261315 states and 372866 transitions. Word has length 150 [2024-10-14 04:02:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:02:27,812 INFO L471 AbstractCegarLoop]: Abstraction has 261315 states and 372866 transitions. [2024-10-14 04:02:27,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 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-14 04:02:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 261315 states and 372866 transitions. [2024-10-14 04:02:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 04:02:27,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:02:27,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:02:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 04:02:27,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:02:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:02:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1031515645, now seen corresponding path program 1 times [2024-10-14 04:02:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:02:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898740475] [2024-10-14 04:02:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:02:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:02:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:02:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 04:02:29,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:02:29,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898740475] [2024-10-14 04:02:29,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898740475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:02:29,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:02:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 04:02:29,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567955686] [2024-10-14 04:02:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:02:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 04:02:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:02:29,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 04:02:29,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:02:29,128 INFO L87 Difference]: Start difference. First operand 261315 states and 372866 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)