./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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37da121d1485cf4d7db5098d27ad9010a5336c778943ff6fd7c53fe4a9fdfbdc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:24:40,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:24:40,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:24:40,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:24:40,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:24:40,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:24:40,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:24:40,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:24:40,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:24:40,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:24:40,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:24:40,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:24:40,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:24:40,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:24:40,457 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:24:40,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:24:40,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:24:40,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:24:40,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:24:40,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:24:40,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:24:40,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:24:40,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:24:40,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:24:40,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:24:40,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:24:40,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:24:40,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:24:40,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:24:40,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:24:40,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:24:40,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:24:40,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:24:40,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:24:40,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:24:40,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:24:40,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:24:40,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:24:40,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:24:40,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:24:40,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:24:40,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:24:40,464 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 -> 37da121d1485cf4d7db5098d27ad9010a5336c778943ff6fd7c53fe4a9fdfbdc [2024-10-12 20:24:40,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:24:40,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:24:40,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:24:40,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:24:40,732 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:24:40,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:24:42,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:24:42,352 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:24:42,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:24:42,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9d2fe25/224d8385ec8f417ca1bde97f86d60c01/FLAG2ebaff363 [2024-10-12 20:24:42,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9d2fe25/224d8385ec8f417ca1bde97f86d60c01 [2024-10-12 20:24:42,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:24:42,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:24:42,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:24:42,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:24:42,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:24:42,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:42,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8a7705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42, skipping insertion in model container [2024-10-12 20:24:42,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:42,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:24:42,739 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8458,8471] [2024-10-12 20:24:42,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:24:42,806 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:24:42,872 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8458,8471] [2024-10-12 20:24:42,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:24:42,913 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:24:42,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42 WrapperNode [2024-10-12 20:24:42,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:24:42,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:24:42,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:24:42,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:24:42,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:42,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:42,976 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 864 [2024-10-12 20:24:42,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:24:42,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:24:42,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:24:42,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:24:42,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:42,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:42,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,017 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-12 20:24:43,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:24:43,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:24:43,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:24:43,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:24:43,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (1/1) ... [2024-10-12 20:24:43,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:24:43,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:24:43,088 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-12 20:24:43,091 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-12 20:24:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:24:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:24:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:24:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:24:43,307 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:24:43,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:24:44,167 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-12 20:24:44,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:24:44,203 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:24:44,203 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:24:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:24:44 BoogieIcfgContainer [2024-10-12 20:24:44,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:24:44,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:24:44,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:24:44,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:24:44,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:24:42" (1/3) ... [2024-10-12 20:24:44,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4700ae75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:24:44, skipping insertion in model container [2024-10-12 20:24:44,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:42" (2/3) ... [2024-10-12 20:24:44,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4700ae75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:24:44, skipping insertion in model container [2024-10-12 20:24:44,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:24:44" (3/3) ... [2024-10-12 20:24:44,211 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:24:44,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:24:44,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:24:44,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:24:44,281 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;@7289898e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:24:44,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:24:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 211 states have (on average 1.7251184834123223) internal successors, (364), 212 states have internal predecessors, (364), 0 states have call successors, (0), 0 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-12 20:24:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:24:44,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:44,294 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] [2024-10-12 20:24:44,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:44,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash 238097348, now seen corresponding path program 1 times [2024-10-12 20:24:44,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:44,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079345745] [2024-10-12 20:24:44,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:44,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:44,862 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-12 20:24:44,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:44,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079345745] [2024-10-12 20:24:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079345745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:44,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864211442] [2024-10-12 20:24:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:44,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:44,896 INFO L87 Difference]: Start difference. First operand has 213 states, 211 states have (on average 1.7251184834123223) internal successors, (364), 212 states have internal predecessors, (364), 0 states have call successors, (0), 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 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-12 20:24:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:45,134 INFO L93 Difference]: Finished difference Result 859 states and 1394 transitions. [2024-10-12 20:24:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:24:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:24:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:45,149 INFO L225 Difference]: With dead ends: 859 [2024-10-12 20:24:45,149 INFO L226 Difference]: Without dead ends: 746 [2024-10-12 20:24:45,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:24:45,158 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 2365 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:45,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 2173 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:24:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-12 20:24:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 327. [2024-10-12 20:24:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.50920245398773) internal successors, (492), 326 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-12 20:24:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 492 transitions. [2024-10-12 20:24:45,227 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 492 transitions. Word has length 79 [2024-10-12 20:24:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:45,228 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 492 transitions. [2024-10-12 20:24:45,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-12 20:24:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 492 transitions. [2024-10-12 20:24:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:24:45,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:45,231 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] [2024-10-12 20:24:45,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:24:45,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:45,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1488805870, now seen corresponding path program 1 times [2024-10-12 20:24:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:45,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194297214] [2024-10-12 20:24:45,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:45,546 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-12 20:24:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194297214] [2024-10-12 20:24:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194297214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143688238] [2024-10-12 20:24:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:45,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:45,552 INFO L87 Difference]: Start difference. First operand 327 states and 492 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-12 20:24:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:45,743 INFO L93 Difference]: Finished difference Result 1423 states and 2209 transitions. [2024-10-12 20:24:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:24:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-12 20:24:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:45,749 INFO L225 Difference]: With dead ends: 1423 [2024-10-12 20:24:45,750 INFO L226 Difference]: Without dead ends: 1175 [2024-10-12 20:24:45,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:45,754 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 1556 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:45,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 1412 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-10-12 20:24:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1167. [2024-10-12 20:24:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1166 states have (on average 1.5480274442538593) internal successors, (1805), 1166 states have internal predecessors, (1805), 0 states have call successors, (0), 0 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-12 20:24:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1805 transitions. [2024-10-12 20:24:45,799 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1805 transitions. Word has length 80 [2024-10-12 20:24:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:45,800 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1805 transitions. [2024-10-12 20:24:45,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-12 20:24:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1805 transitions. [2024-10-12 20:24:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:24:45,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:45,808 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] [2024-10-12 20:24:45,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:24:45,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1568346073, now seen corresponding path program 1 times [2024-10-12 20:24:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458868400] [2024-10-12 20:24:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:45,976 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-12 20:24:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458868400] [2024-10-12 20:24:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458868400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810665117] [2024-10-12 20:24:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:45,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:45,981 INFO L87 Difference]: Start difference. First operand 1167 states and 1805 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:46,236 INFO L93 Difference]: Finished difference Result 3104 states and 4858 transitions. [2024-10-12 20:24:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:24:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:46,246 INFO L225 Difference]: With dead ends: 3104 [2024-10-12 20:24:46,246 INFO L226 Difference]: Without dead ends: 2017 [2024-10-12 20:24:46,249 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-12 20:24:46,250 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1168 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:46,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 296 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2024-10-12 20:24:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2015. [2024-10-12 20:24:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.5566037735849056) internal successors, (3135), 2014 states have internal predecessors, (3135), 0 states have call successors, (0), 0 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-12 20:24:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3135 transitions. [2024-10-12 20:24:46,294 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 3135 transitions. Word has length 81 [2024-10-12 20:24:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:46,295 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 3135 transitions. [2024-10-12 20:24:46,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 3135 transitions. [2024-10-12 20:24:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:24:46,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:46,297 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] [2024-10-12 20:24:46,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:24:46,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 945560248, now seen corresponding path program 1 times [2024-10-12 20:24:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934348946] [2024-10-12 20:24:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:46,417 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-12 20:24:46,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:46,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934348946] [2024-10-12 20:24:46,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934348946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:46,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909173950] [2024-10-12 20:24:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:46,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:46,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:46,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:46,420 INFO L87 Difference]: Start difference. First operand 2015 states and 3135 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:46,641 INFO L93 Difference]: Finished difference Result 5536 states and 8683 transitions. [2024-10-12 20:24:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:46,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:24:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:46,655 INFO L225 Difference]: With dead ends: 5536 [2024-10-12 20:24:46,655 INFO L226 Difference]: Without dead ends: 3631 [2024-10-12 20:24:46,661 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-12 20:24:46,663 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1134 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:46,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 296 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2024-10-12 20:24:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3629. [2024-10-12 20:24:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 3628 states have (on average 1.5595369349503858) internal successors, (5658), 3628 states have internal predecessors, (5658), 0 states have call successors, (0), 0 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-12 20:24:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5658 transitions. [2024-10-12 20:24:46,724 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5658 transitions. Word has length 81 [2024-10-12 20:24:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:46,725 INFO L471 AbstractCegarLoop]: Abstraction has 3629 states and 5658 transitions. [2024-10-12 20:24:46,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5658 transitions. [2024-10-12 20:24:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:24:46,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:46,728 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] [2024-10-12 20:24:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:24:46,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1454177033, now seen corresponding path program 1 times [2024-10-12 20:24:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874580691] [2024-10-12 20:24:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:46,848 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-12 20:24:46,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:46,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874580691] [2024-10-12 20:24:46,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874580691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:46,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:46,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:46,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743722625] [2024-10-12 20:24:46,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:46,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:46,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:46,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:46,850 INFO L87 Difference]: Start difference. First operand 3629 states and 5658 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:47,061 INFO L93 Difference]: Finished difference Result 10316 states and 16187 transitions. [2024-10-12 20:24:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:47,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:24:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:47,081 INFO L225 Difference]: With dead ends: 10316 [2024-10-12 20:24:47,081 INFO L226 Difference]: Without dead ends: 6831 [2024-10-12 20:24:47,087 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-12 20:24:47,088 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1116 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:47,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 307 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6831 states. [2024-10-12 20:24:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6831 to 6829. [2024-10-12 20:24:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6829 states, 6828 states have (on average 1.5619507908611598) internal successors, (10665), 6828 states have internal predecessors, (10665), 0 states have call successors, (0), 0 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-12 20:24:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6829 states to 6829 states and 10665 transitions. [2024-10-12 20:24:47,209 INFO L78 Accepts]: Start accepts. Automaton has 6829 states and 10665 transitions. Word has length 81 [2024-10-12 20:24:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:47,211 INFO L471 AbstractCegarLoop]: Abstraction has 6829 states and 10665 transitions. [2024-10-12 20:24:47,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6829 states and 10665 transitions. [2024-10-12 20:24:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:24:47,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:47,213 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] [2024-10-12 20:24:47,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:24:47,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash -415106218, now seen corresponding path program 1 times [2024-10-12 20:24:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272516630] [2024-10-12 20:24:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:47,349 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-12 20:24:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272516630] [2024-10-12 20:24:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272516630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:47,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:47,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523321546] [2024-10-12 20:24:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:47,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:47,353 INFO L87 Difference]: Start difference. First operand 6829 states and 10665 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:47,640 INFO L93 Difference]: Finished difference Result 20143 states and 31539 transitions. [2024-10-12 20:24:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:47,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:24:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:47,688 INFO L225 Difference]: With dead ends: 20143 [2024-10-12 20:24:47,688 INFO L226 Difference]: Without dead ends: 13371 [2024-10-12 20:24:47,699 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-12 20:24:47,700 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1182 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:47,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 294 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2024-10-12 20:24:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 13369. [2024-10-12 20:24:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13369 states, 13368 states have (on average 1.5567025733093955) internal successors, (20810), 13368 states have internal predecessors, (20810), 0 states have call successors, (0), 0 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-12 20:24:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 20810 transitions. [2024-10-12 20:24:47,893 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 20810 transitions. Word has length 81 [2024-10-12 20:24:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:47,894 INFO L471 AbstractCegarLoop]: Abstraction has 13369 states and 20810 transitions. [2024-10-12 20:24:47,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 20810 transitions. [2024-10-12 20:24:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:24:47,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:47,897 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] [2024-10-12 20:24:47,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:24:47,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:47,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1656601669, now seen corresponding path program 1 times [2024-10-12 20:24:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626370016] [2024-10-12 20:24:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:48,041 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-12 20:24:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626370016] [2024-10-12 20:24:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626370016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239325495] [2024-10-12 20:24:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:48,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:48,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:48,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:48,044 INFO L87 Difference]: Start difference. First operand 13369 states and 20810 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:48,356 INFO L93 Difference]: Finished difference Result 37564 states and 58553 transitions. [2024-10-12 20:24:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:24:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:48,399 INFO L225 Difference]: With dead ends: 37564 [2024-10-12 20:24:48,399 INFO L226 Difference]: Without dead ends: 24236 [2024-10-12 20:24:48,420 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-12 20:24:48,423 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1212 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:48,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 290 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:24:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24236 states. [2024-10-12 20:24:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24236 to 24234. [2024-10-12 20:24:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24234 states, 24233 states have (on average 1.5473527833945446) internal successors, (37497), 24233 states have internal predecessors, (37497), 0 states have call successors, (0), 0 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-12 20:24:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24234 states to 24234 states and 37497 transitions. [2024-10-12 20:24:48,865 INFO L78 Accepts]: Start accepts. Automaton has 24234 states and 37497 transitions. Word has length 81 [2024-10-12 20:24:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:48,865 INFO L471 AbstractCegarLoop]: Abstraction has 24234 states and 37497 transitions. [2024-10-12 20:24:48,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-12 20:24:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 24234 states and 37497 transitions. [2024-10-12 20:24:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:24:48,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:48,871 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] [2024-10-12 20:24:48,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:24:48,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:48,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1146010974, now seen corresponding path program 1 times [2024-10-12 20:24:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677009328] [2024-10-12 20:24:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:49,219 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-12 20:24:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677009328] [2024-10-12 20:24:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677009328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:49,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675592227] [2024-10-12 20:24:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:49,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:49,221 INFO L87 Difference]: Start difference. First operand 24234 states and 37497 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-12 20:24:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:49,859 INFO L93 Difference]: Finished difference Result 47773 states and 73385 transitions. [2024-10-12 20:24:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:24:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-12 20:24:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:49,916 INFO L225 Difference]: With dead ends: 47773 [2024-10-12 20:24:49,916 INFO L226 Difference]: Without dead ends: 33781 [2024-10-12 20:24:49,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:24:49,937 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1385 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:49,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 944 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:24:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33781 states. [2024-10-12 20:24:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33781 to 24527. [2024-10-12 20:24:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24527 states, 24526 states have (on average 1.5452988665090108) internal successors, (37900), 24526 states have internal predecessors, (37900), 0 states have call successors, (0), 0 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-12 20:24:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24527 states to 24527 states and 37900 transitions. [2024-10-12 20:24:50,504 INFO L78 Accepts]: Start accepts. Automaton has 24527 states and 37900 transitions. Word has length 82 [2024-10-12 20:24:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:50,505 INFO L471 AbstractCegarLoop]: Abstraction has 24527 states and 37900 transitions. [2024-10-12 20:24:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-12 20:24:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24527 states and 37900 transitions. [2024-10-12 20:24:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:24:50,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:50,511 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] [2024-10-12 20:24:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:24:50,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1466189182, now seen corresponding path program 1 times [2024-10-12 20:24:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060135824] [2024-10-12 20:24:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060135824] [2024-10-12 20:24:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060135824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:24:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018563852] [2024-10-12 20:24:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:50,935 INFO L87 Difference]: Start difference. First operand 24527 states and 37900 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-12 20:24:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:51,004 INFO L93 Difference]: Finished difference Result 25105 states and 38765 transitions. [2024-10-12 20:24:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-12 20:24:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:51,043 INFO L225 Difference]: With dead ends: 25105 [2024-10-12 20:24:51,043 INFO L226 Difference]: Without dead ends: 25103 [2024-10-12 20:24:51,052 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-12 20:24:51,053 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 0 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:51,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1161 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25103 states. [2024-10-12 20:24:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25103 to 25103. [2024-10-12 20:24:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25103 states, 25102 states have (on average 1.5327862321727352) internal successors, (38476), 25102 states have internal predecessors, (38476), 0 states have call successors, (0), 0 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-12 20:24:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25103 states to 25103 states and 38476 transitions. [2024-10-12 20:24:51,361 INFO L78 Accepts]: Start accepts. Automaton has 25103 states and 38476 transitions. Word has length 82 [2024-10-12 20:24:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 25103 states and 38476 transitions. [2024-10-12 20:24:51,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-12 20:24:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states and 38476 transitions. [2024-10-12 20:24:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:51,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:51,369 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] [2024-10-12 20:24:51,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:24:51,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:51,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1513368446, now seen corresponding path program 1 times [2024-10-12 20:24:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373686505] [2024-10-12 20:24:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:51,830 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-12 20:24:51,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:51,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373686505] [2024-10-12 20:24:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373686505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:51,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959620319] [2024-10-12 20:24:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:51,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:51,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:51,833 INFO L87 Difference]: Start difference. First operand 25103 states and 38476 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:52,722 INFO L93 Difference]: Finished difference Result 47899 states and 72799 transitions. [2024-10-12 20:24:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:24:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:52,769 INFO L225 Difference]: With dead ends: 47899 [2024-10-12 20:24:52,769 INFO L226 Difference]: Without dead ends: 39065 [2024-10-12 20:24:52,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:24:52,785 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 993 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:52,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1240 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:24:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39065 states. [2024-10-12 20:24:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39065 to 25639. [2024-10-12 20:24:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25639 states, 25638 states have (on average 1.530813636009049) internal successors, (39247), 25638 states have internal predecessors, (39247), 0 states have call successors, (0), 0 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-12 20:24:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25639 states to 25639 states and 39247 transitions. [2024-10-12 20:24:53,155 INFO L78 Accepts]: Start accepts. Automaton has 25639 states and 39247 transitions. Word has length 83 [2024-10-12 20:24:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:53,155 INFO L471 AbstractCegarLoop]: Abstraction has 25639 states and 39247 transitions. [2024-10-12 20:24:53,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25639 states and 39247 transitions. [2024-10-12 20:24:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:53,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:53,162 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] [2024-10-12 20:24:53,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:24:53,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2116249502, now seen corresponding path program 1 times [2024-10-12 20:24:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438815587] [2024-10-12 20:24:53,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:53,642 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-12 20:24:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438815587] [2024-10-12 20:24:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438815587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:53,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:53,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727789603] [2024-10-12 20:24:53,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:53,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:53,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:53,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:53,643 INFO L87 Difference]: Start difference. First operand 25639 states and 39247 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:54,400 INFO L93 Difference]: Finished difference Result 32420 states and 49297 transitions. [2024-10-12 20:24:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:24:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:54,483 INFO L225 Difference]: With dead ends: 32420 [2024-10-12 20:24:54,484 INFO L226 Difference]: Without dead ends: 29113 [2024-10-12 20:24:54,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:24:54,510 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1173 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:54,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 942 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:24:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29113 states. [2024-10-12 20:24:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29113 to 25639. [2024-10-12 20:24:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25639 states, 25638 states have (on average 1.5306576175988766) internal successors, (39243), 25638 states have internal predecessors, (39243), 0 states have call successors, (0), 0 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-12 20:24:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25639 states to 25639 states and 39243 transitions. [2024-10-12 20:24:54,930 INFO L78 Accepts]: Start accepts. Automaton has 25639 states and 39243 transitions. Word has length 83 [2024-10-12 20:24:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:54,931 INFO L471 AbstractCegarLoop]: Abstraction has 25639 states and 39243 transitions. [2024-10-12 20:24:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 25639 states and 39243 transitions. [2024-10-12 20:24:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:54,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:54,940 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] [2024-10-12 20:24:54,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:24:54,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:54,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1194992834, now seen corresponding path program 1 times [2024-10-12 20:24:54,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:54,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14317776] [2024-10-12 20:24:54,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:54,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:55,223 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-12 20:24:55,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:55,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14317776] [2024-10-12 20:24:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14317776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:55,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412250818] [2024-10-12 20:24:55,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:55,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:55,226 INFO L87 Difference]: Start difference. First operand 25639 states and 39243 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:56,000 INFO L93 Difference]: Finished difference Result 58219 states and 88530 transitions. [2024-10-12 20:24:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:24:56,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:56,046 INFO L225 Difference]: With dead ends: 58219 [2024-10-12 20:24:56,047 INFO L226 Difference]: Without dead ends: 38500 [2024-10-12 20:24:56,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:24:56,071 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1283 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:56,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1030 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:24:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38500 states. [2024-10-12 20:24:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38500 to 26056. [2024-10-12 20:24:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26056 states, 26055 states have (on average 1.5268470543081942) internal successors, (39782), 26055 states have internal predecessors, (39782), 0 states have call successors, (0), 0 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-12 20:24:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26056 states to 26056 states and 39782 transitions. [2024-10-12 20:24:56,525 INFO L78 Accepts]: Start accepts. Automaton has 26056 states and 39782 transitions. Word has length 83 [2024-10-12 20:24:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 26056 states and 39782 transitions. [2024-10-12 20:24:56,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26056 states and 39782 transitions. [2024-10-12 20:24:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:56,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:56,531 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] [2024-10-12 20:24:56,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:24:56,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1796815074, now seen corresponding path program 1 times [2024-10-12 20:24:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137788242] [2024-10-12 20:24:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:56,877 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-12 20:24:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137788242] [2024-10-12 20:24:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137788242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503240209] [2024-10-12 20:24:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:56,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:56,879 INFO L87 Difference]: Start difference. First operand 26056 states and 39782 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:57,619 INFO L93 Difference]: Finished difference Result 66038 states and 100244 transitions. [2024-10-12 20:24:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:24:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:57,667 INFO L225 Difference]: With dead ends: 66038 [2024-10-12 20:24:57,667 INFO L226 Difference]: Without dead ends: 41404 [2024-10-12 20:24:57,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:24:57,692 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 936 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:57,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1249 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:24:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2024-10-12 20:24:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 26431. [2024-10-12 20:24:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26431 states, 26430 states have (on average 1.521604237608778) internal successors, (40216), 26430 states have internal predecessors, (40216), 0 states have call successors, (0), 0 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-12 20:24:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26431 states to 26431 states and 40216 transitions. [2024-10-12 20:24:58,246 INFO L78 Accepts]: Start accepts. Automaton has 26431 states and 40216 transitions. Word has length 83 [2024-10-12 20:24:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:58,246 INFO L471 AbstractCegarLoop]: Abstraction has 26431 states and 40216 transitions. [2024-10-12 20:24:58,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-12 20:24:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26431 states and 40216 transitions. [2024-10-12 20:24:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:58,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:58,253 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] [2024-10-12 20:24:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:24:58,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1075536573, now seen corresponding path program 1 times [2024-10-12 20:24:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052296251] [2024-10-12 20:24:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:58,307 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-12 20:24:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:58,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052296251] [2024-10-12 20:24:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052296251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:58,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:58,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952611994] [2024-10-12 20:24:58,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:58,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:58,310 INFO L87 Difference]: Start difference. First operand 26431 states and 40216 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:24:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:58,418 INFO L93 Difference]: Finished difference Result 42933 states and 65516 transitions. [2024-10-12 20:24:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:58,457 INFO L225 Difference]: With dead ends: 42933 [2024-10-12 20:24:58,457 INFO L226 Difference]: Without dead ends: 31191 [2024-10-12 20:24:58,475 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-12 20:24:58,475 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 182 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:58,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 594 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31191 states. [2024-10-12 20:24:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31191 to 30921. [2024-10-12 20:24:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30921 states, 30920 states have (on average 1.5067270375161708) internal successors, (46588), 30920 states have internal predecessors, (46588), 0 states have call successors, (0), 0 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-12 20:24:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30921 states to 30921 states and 46588 transitions. [2024-10-12 20:24:58,901 INFO L78 Accepts]: Start accepts. Automaton has 30921 states and 46588 transitions. Word has length 84 [2024-10-12 20:24:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:58,902 INFO L471 AbstractCegarLoop]: Abstraction has 30921 states and 46588 transitions. [2024-10-12 20:24:58,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:24:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30921 states and 46588 transitions. [2024-10-12 20:24:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:58,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:58,908 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] [2024-10-12 20:24:58,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:24:58,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:24:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1401966641, now seen corresponding path program 1 times [2024-10-12 20:24:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389250756] [2024-10-12 20:24:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:59,012 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-12 20:24:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389250756] [2024-10-12 20:24:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389250756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:59,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:59,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64562421] [2024-10-12 20:24:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:59,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:24:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:59,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:24:59,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:59,015 INFO L87 Difference]: Start difference. First operand 30921 states and 46588 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:24:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:59,469 INFO L93 Difference]: Finished difference Result 84549 states and 127646 transitions. [2024-10-12 20:24:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:24:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:59,538 INFO L225 Difference]: With dead ends: 84549 [2024-10-12 20:24:59,538 INFO L226 Difference]: Without dead ends: 55955 [2024-10-12 20:24:59,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:59,561 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 202 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 727 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-12 20:24:59,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 727 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55955 states. [2024-10-12 20:25:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55955 to 55617. [2024-10-12 20:25:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55617 states, 55616 states have (on average 1.495325086306099) internal successors, (83164), 55616 states have internal predecessors, (83164), 0 states have call successors, (0), 0 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-12 20:25:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55617 states to 55617 states and 83164 transitions. [2024-10-12 20:25:00,302 INFO L78 Accepts]: Start accepts. Automaton has 55617 states and 83164 transitions. Word has length 84 [2024-10-12 20:25:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:00,302 INFO L471 AbstractCegarLoop]: Abstraction has 55617 states and 83164 transitions. [2024-10-12 20:25:00,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 55617 states and 83164 transitions. [2024-10-12 20:25:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:25:00,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:00,308 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] [2024-10-12 20:25:00,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:25:00,308 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:00,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1298454314, now seen corresponding path program 1 times [2024-10-12 20:25:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438324056] [2024-10-12 20:25:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:00,356 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-12 20:25:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438324056] [2024-10-12 20:25:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438324056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:00,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103577694] [2024-10-12 20:25:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:00,358 INFO L87 Difference]: Start difference. First operand 55617 states and 83164 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:00,970 INFO L93 Difference]: Finished difference Result 73572 states and 109788 transitions. [2024-10-12 20:25:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:00,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:25:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:01,076 INFO L225 Difference]: With dead ends: 73572 [2024-10-12 20:25:01,076 INFO L226 Difference]: Without dead ends: 57126 [2024-10-12 20:25:01,104 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-12 20:25:01,105 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 174 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:01,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 571 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57126 states. [2024-10-12 20:25:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57126 to 52108. [2024-10-12 20:25:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52108 states, 52107 states have (on average 1.4752720363866658) internal successors, (76872), 52107 states have internal predecessors, (76872), 0 states have call successors, (0), 0 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-12 20:25:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52108 states to 52108 states and 76872 transitions. [2024-10-12 20:25:02,358 INFO L78 Accepts]: Start accepts. Automaton has 52108 states and 76872 transitions. Word has length 84 [2024-10-12 20:25:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 52108 states and 76872 transitions. [2024-10-12 20:25:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 52108 states and 76872 transitions. [2024-10-12 20:25:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:25:02,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:02,364 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] [2024-10-12 20:25:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:25:02,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 335873668, now seen corresponding path program 1 times [2024-10-12 20:25:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324456607] [2024-10-12 20:25:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:02,406 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-12 20:25:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324456607] [2024-10-12 20:25:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324456607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354673421] [2024-10-12 20:25:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:02,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:02,408 INFO L87 Difference]: Start difference. First operand 52108 states and 76872 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:02,666 INFO L93 Difference]: Finished difference Result 117585 states and 173774 transitions. [2024-10-12 20:25:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:02,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:25:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:02,753 INFO L225 Difference]: With dead ends: 117585 [2024-10-12 20:25:02,754 INFO L226 Difference]: Without dead ends: 71125 [2024-10-12 20:25:02,798 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-12 20:25:02,798 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 211 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:02,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 558 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71125 states. [2024-10-12 20:25:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71125 to 70971. [2024-10-12 20:25:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70971 states, 70970 states have (on average 1.4622657460898971) internal successors, (103777), 70970 states have internal predecessors, (103777), 0 states have call successors, (0), 0 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-12 20:25:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70971 states to 70971 states and 103777 transitions. [2024-10-12 20:25:03,954 INFO L78 Accepts]: Start accepts. Automaton has 70971 states and 103777 transitions. Word has length 84 [2024-10-12 20:25:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:03,954 INFO L471 AbstractCegarLoop]: Abstraction has 70971 states and 103777 transitions. [2024-10-12 20:25:03,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 70971 states and 103777 transitions. [2024-10-12 20:25:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:25:03,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:03,968 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] [2024-10-12 20:25:03,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:25:03,969 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:03,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:03,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1506222844, now seen corresponding path program 1 times [2024-10-12 20:25:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:03,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368918677] [2024-10-12 20:25:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:04,013 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-12 20:25:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368918677] [2024-10-12 20:25:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368918677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683368879] [2024-10-12 20:25:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:04,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:04,014 INFO L87 Difference]: Start difference. First operand 70971 states and 103777 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:04,598 INFO L93 Difference]: Finished difference Result 138385 states and 202346 transitions. [2024-10-12 20:25:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:25:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:04,706 INFO L225 Difference]: With dead ends: 138385 [2024-10-12 20:25:04,706 INFO L226 Difference]: Without dead ends: 85331 [2024-10-12 20:25:04,757 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-12 20:25:04,757 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 187 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:04,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 666 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85331 states. [2024-10-12 20:25:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85331 to 84561. [2024-10-12 20:25:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84561 states, 84560 states have (on average 1.4373699148533585) internal successors, (121544), 84560 states have internal predecessors, (121544), 0 states have call successors, (0), 0 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-12 20:25:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84561 states to 84561 states and 121544 transitions. [2024-10-12 20:25:06,150 INFO L78 Accepts]: Start accepts. Automaton has 84561 states and 121544 transitions. Word has length 84 [2024-10-12 20:25:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:06,151 INFO L471 AbstractCegarLoop]: Abstraction has 84561 states and 121544 transitions. [2024-10-12 20:25:06,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 84561 states and 121544 transitions. [2024-10-12 20:25:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:25:06,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:06,159 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] [2024-10-12 20:25:06,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:25:06,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2020876259, now seen corresponding path program 1 times [2024-10-12 20:25:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196646009] [2024-10-12 20:25:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:06,217 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-12 20:25:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196646009] [2024-10-12 20:25:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196646009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915087128] [2024-10-12 20:25:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:06,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:06,219 INFO L87 Difference]: Start difference. First operand 84561 states and 121544 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:07,056 INFO L93 Difference]: Finished difference Result 182795 states and 262010 transitions. [2024-10-12 20:25:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:07,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:25:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:07,220 INFO L225 Difference]: With dead ends: 182795 [2024-10-12 20:25:07,220 INFO L226 Difference]: Without dead ends: 104145 [2024-10-12 20:25:07,273 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-12 20:25:07,273 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 200 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:07,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 556 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104145 states. [2024-10-12 20:25:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104145 to 103427. [2024-10-12 20:25:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103427 states, 103426 states have (on average 1.4073733877361592) internal successors, (145559), 103426 states have internal predecessors, (145559), 0 states have call successors, (0), 0 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-12 20:25:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103427 states to 103427 states and 145559 transitions. [2024-10-12 20:25:08,658 INFO L78 Accepts]: Start accepts. Automaton has 103427 states and 145559 transitions. Word has length 84 [2024-10-12 20:25:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:08,658 INFO L471 AbstractCegarLoop]: Abstraction has 103427 states and 145559 transitions. [2024-10-12 20:25:08,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 20:25:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 103427 states and 145559 transitions. [2024-10-12 20:25:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:08,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:08,664 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] [2024-10-12 20:25:08,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:25:08,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 782936475, now seen corresponding path program 1 times [2024-10-12 20:25:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093491488] [2024-10-12 20:25:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:08,760 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-12 20:25:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093491488] [2024-10-12 20:25:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093491488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669943483] [2024-10-12 20:25:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:08,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:08,762 INFO L87 Difference]: Start difference. First operand 103427 states and 145559 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:09,794 INFO L93 Difference]: Finished difference Result 251899 states and 357363 transitions. [2024-10-12 20:25:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:10,149 INFO L225 Difference]: With dead ends: 251899 [2024-10-12 20:25:10,149 INFO L226 Difference]: Without dead ends: 214493 [2024-10-12 20:25:10,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:25:10,240 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1761 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 1680 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.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:10,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 1680 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214493 states. [2024-10-12 20:25:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214493 to 140378. [2024-10-12 20:25:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140378 states, 140377 states have (on average 1.4078303425774878) internal successors, (197627), 140377 states have internal predecessors, (197627), 0 states have call successors, (0), 0 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-12 20:25:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140378 states to 140378 states and 197627 transitions. [2024-10-12 20:25:13,167 INFO L78 Accepts]: Start accepts. Automaton has 140378 states and 197627 transitions. Word has length 85 [2024-10-12 20:25:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:13,167 INFO L471 AbstractCegarLoop]: Abstraction has 140378 states and 197627 transitions. [2024-10-12 20:25:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 140378 states and 197627 transitions. [2024-10-12 20:25:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:13,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:13,174 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] [2024-10-12 20:25:13,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:25:13,175 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:13,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1882709334, now seen corresponding path program 1 times [2024-10-12 20:25:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062469668] [2024-10-12 20:25:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:13,305 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-12 20:25:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062469668] [2024-10-12 20:25:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062469668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:13,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79988983] [2024-10-12 20:25:13,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:13,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:13,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:13,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:13,307 INFO L87 Difference]: Start difference. First operand 140378 states and 197627 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:14,464 INFO L93 Difference]: Finished difference Result 262913 states and 372422 transitions. [2024-10-12 20:25:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:14,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:14,861 INFO L225 Difference]: With dead ends: 262913 [2024-10-12 20:25:14,861 INFO L226 Difference]: Without dead ends: 238539 [2024-10-12 20:25:14,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:25:14,962 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1856 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:14,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 1702 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238539 states. [2024-10-12 20:25:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238539 to 155700. [2024-10-12 20:25:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155700 states, 155699 states have (on average 1.4095337799215153) internal successors, (219463), 155699 states have internal predecessors, (219463), 0 states have call successors, (0), 0 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-12 20:25:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155700 states to 155700 states and 219463 transitions. [2024-10-12 20:25:18,224 INFO L78 Accepts]: Start accepts. Automaton has 155700 states and 219463 transitions. Word has length 85 [2024-10-12 20:25:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:18,224 INFO L471 AbstractCegarLoop]: Abstraction has 155700 states and 219463 transitions. [2024-10-12 20:25:18,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 155700 states and 219463 transitions. [2024-10-12 20:25:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:18,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:18,232 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] [2024-10-12 20:25:18,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:25:18,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:18,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash -657030305, now seen corresponding path program 1 times [2024-10-12 20:25:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79372557] [2024-10-12 20:25:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:18,864 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-12 20:25:18,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:18,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79372557] [2024-10-12 20:25:18,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79372557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:18,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:18,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793935352] [2024-10-12 20:25:18,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:18,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:18,869 INFO L87 Difference]: Start difference. First operand 155700 states and 219463 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:19,646 INFO L93 Difference]: Finished difference Result 260195 states and 368192 transitions. [2024-10-12 20:25:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:20,096 INFO L225 Difference]: With dead ends: 260195 [2024-10-12 20:25:20,096 INFO L226 Difference]: Without dead ends: 249285 [2024-10-12 20:25:20,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:25:20,182 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1766 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:20,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 1792 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249285 states. [2024-10-12 20:25:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249285 to 166446. [2024-10-12 20:25:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166446 states, 166445 states have (on average 1.409696896872841) internal successors, (234637), 166445 states have internal predecessors, (234637), 0 states have call successors, (0), 0 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-12 20:25:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166446 states to 166446 states and 234637 transitions. [2024-10-12 20:25:23,174 INFO L78 Accepts]: Start accepts. Automaton has 166446 states and 234637 transitions. Word has length 85 [2024-10-12 20:25:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:23,174 INFO L471 AbstractCegarLoop]: Abstraction has 166446 states and 234637 transitions. [2024-10-12 20:25:23,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 166446 states and 234637 transitions. [2024-10-12 20:25:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:23,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:23,180 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] [2024-10-12 20:25:23,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:25:23,180 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:23,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash 27365530, now seen corresponding path program 1 times [2024-10-12 20:25:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171046963] [2024-10-12 20:25:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:23,833 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-12 20:25:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171046963] [2024-10-12 20:25:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171046963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528542464] [2024-10-12 20:25:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:23,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:23,835 INFO L87 Difference]: Start difference. First operand 166446 states and 234637 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:25,081 INFO L93 Difference]: Finished difference Result 332076 states and 470445 transitions. [2024-10-12 20:25:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:25,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:25,560 INFO L225 Difference]: With dead ends: 332076 [2024-10-12 20:25:25,560 INFO L226 Difference]: Without dead ends: 286054 [2024-10-12 20:25:25,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:25:25,680 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 1664 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:25,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 2102 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286054 states. [2024-10-12 20:25:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286054 to 191709. [2024-10-12 20:25:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191709 states, 191708 states have (on average 1.4109061697999041) internal successors, (270482), 191708 states have internal predecessors, (270482), 0 states have call successors, (0), 0 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-12 20:25:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191709 states to 191709 states and 270482 transitions. [2024-10-12 20:25:29,924 INFO L78 Accepts]: Start accepts. Automaton has 191709 states and 270482 transitions. Word has length 85 [2024-10-12 20:25:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:29,924 INFO L471 AbstractCegarLoop]: Abstraction has 191709 states and 270482 transitions. [2024-10-12 20:25:29,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 191709 states and 270482 transitions. [2024-10-12 20:25:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:29,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:29,932 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] [2024-10-12 20:25:29,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:25:29,932 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:25:29,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash 975723729, now seen corresponding path program 1 times [2024-10-12 20:25:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022704008] [2024-10-12 20:25:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:30,025 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-12 20:25:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022704008] [2024-10-12 20:25:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022704008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698102563] [2024-10-12 20:25:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:30,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:30,027 INFO L87 Difference]: Start difference. First operand 191709 states and 270482 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 20:25:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:31,705 INFO L93 Difference]: Finished difference Result 367772 states and 520646 transitions. [2024-10-12 20:25:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:31,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:32,334 INFO L225 Difference]: With dead ends: 367772 [2024-10-12 20:25:32,334 INFO L226 Difference]: Without dead ends: 324309 [2024-10-12 20:25:32,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:25:32,428 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1673 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:32,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1882 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324309 states.