./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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e296f9d0ac3a11e23992c5bf18917d5440a5485ef02dc07f1520f584e052eef8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:43:37,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:43:37,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:43:37,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:43:37,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:43:37,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:43:37,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:43:37,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:43:37,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:43:37,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:43:37,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:43:37,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:43:37,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:43:37,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:43:37,989 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:43:37,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:43:37,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:43:37,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:43:37,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:43:37,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:43:37,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:43:37,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:43:37,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:43:37,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:43:37,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:43:37,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:43:37,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:43:37,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:43:37,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:43:37,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:43:37,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:43:37,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:43:37,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:43:37,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:43:37,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:43:37,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:43:37,996 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 -> e296f9d0ac3a11e23992c5bf18917d5440a5485ef02dc07f1520f584e052eef8 [2024-10-14 03:43:38,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:43:38,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:43:38,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:43:38,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:43:38,267 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:43:38,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-14 03:43:39,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:43:39,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:43:39,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-14 03:43:39,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b27324d/b99f8e11353d4ea8aeb955d861c8c52f/FLAGddf7ace5c [2024-10-14 03:43:40,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b27324d/b99f8e11353d4ea8aeb955d861c8c52f [2024-10-14 03:43:40,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:43:40,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:43:40,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:43:40,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:43:40,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:43:40,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42703c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40, skipping insertion in model container [2024-10-14 03:43:40,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:43:40,395 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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2024-10-14 03:43:40,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:43:40,450 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:43:40,518 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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2024-10-14 03:43:40,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:43:40,561 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:43:40,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40 WrapperNode [2024-10-14 03:43:40,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:43:40,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:43:40,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:43:40,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:43:40,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,615 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2024-10-14 03:43:40,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:43:40,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:43:40,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:43:40,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:43:40,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,648 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:43:40,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:43:40,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:43:40,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:43:40,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:43:40,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (1/1) ... [2024-10-14 03:43:40,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:43:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:43:40,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:43:40,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:43:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:43:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:43:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:43:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:43:40,892 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:43:40,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:43:41,388 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-14 03:43:41,388 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:43:41,439 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:43:41,440 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:43:41,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:43:41 BoogieIcfgContainer [2024-10-14 03:43:41,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:43:41,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:43:41,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:43:41,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:43:41,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:43:40" (1/3) ... [2024-10-14 03:43:41,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e29c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:43:41, skipping insertion in model container [2024-10-14 03:43:41,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:40" (2/3) ... [2024-10-14 03:43:41,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e29c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:43:41, skipping insertion in model container [2024-10-14 03:43:41,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:43:41" (3/3) ... [2024-10-14 03:43:41,450 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-14 03:43:41,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:43:41,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:43:41,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:43:41,527 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;@430e54c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:43:41,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:43:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.786259541984733) internal successors, (234), 132 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:43:41,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:41,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:41,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:41,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -257930743, now seen corresponding path program 1 times [2024-10-14 03:43:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:41,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115543426] [2024-10-14 03:43:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115543426] [2024-10-14 03:43:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115543426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950740776] [2024-10-14 03:43:41,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:41,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:41,999 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.786259541984733) internal successors, (234), 132 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:42,077 INFO L93 Difference]: Finished difference Result 274 states and 471 transitions. [2024-10-14 03:43:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 03:43:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:42,089 INFO L225 Difference]: With dead ends: 274 [2024-10-14 03:43:42,089 INFO L226 Difference]: Without dead ends: 190 [2024-10-14 03:43:42,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,094 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:42,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 388 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-14 03:43:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-10-14 03:43:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5828877005347595) internal successors, (296), 187 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 296 transitions. [2024-10-14 03:43:42,131 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 296 transitions. Word has length 56 [2024-10-14 03:43:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:42,131 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 296 transitions. [2024-10-14 03:43:42,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 296 transitions. [2024-10-14 03:43:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 03:43:42,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:42,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:42,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:43:42,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:42,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1691975926, now seen corresponding path program 1 times [2024-10-14 03:43:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437962059] [2024-10-14 03:43:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437962059] [2024-10-14 03:43:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437962059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:42,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055278296] [2024-10-14 03:43:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:42,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,329 INFO L87 Difference]: Start difference. First operand 188 states and 296 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:42,369 INFO L93 Difference]: Finished difference Result 444 states and 720 transitions. [2024-10-14 03:43:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:42,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-14 03:43:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:42,372 INFO L225 Difference]: With dead ends: 444 [2024-10-14 03:43:42,372 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 03:43:42,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,374 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:42,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 03:43:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-10-14 03:43:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.607843137254902) internal successors, (492), 306 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-14 03:43:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 492 transitions. [2024-10-14 03:43:42,390 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 492 transitions. Word has length 58 [2024-10-14 03:43:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:42,390 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 492 transitions. [2024-10-14 03:43:42,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 492 transitions. [2024-10-14 03:43:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:43:42,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:42,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:43:42,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -62203140, now seen corresponding path program 1 times [2024-10-14 03:43:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056675213] [2024-10-14 03:43:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:42,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056675213] [2024-10-14 03:43:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056675213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831812251] [2024-10-14 03:43:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:42,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,508 INFO L87 Difference]: Start difference. First operand 307 states and 492 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:42,539 INFO L93 Difference]: Finished difference Result 562 states and 916 transitions. [2024-10-14 03:43:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:42,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-14 03:43:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:42,542 INFO L225 Difference]: With dead ends: 562 [2024-10-14 03:43:42,545 INFO L226 Difference]: Without dead ends: 427 [2024-10-14 03:43:42,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,547 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:42,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 442 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-14 03:43:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2024-10-14 03:43:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.6179245283018868) internal successors, (686), 424 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 686 transitions. [2024-10-14 03:43:42,573 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 686 transitions. Word has length 60 [2024-10-14 03:43:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:42,573 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 686 transitions. [2024-10-14 03:43:42,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 686 transitions. [2024-10-14 03:43:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:43:42,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:42,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:43:42,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:42,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1225726807, now seen corresponding path program 1 times [2024-10-14 03:43:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082680826] [2024-10-14 03:43:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:42,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082680826] [2024-10-14 03:43:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082680826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:42,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498332204] [2024-10-14 03:43:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:42,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,690 INFO L87 Difference]: Start difference. First operand 425 states and 686 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:42,713 INFO L93 Difference]: Finished difference Result 1081 states and 1766 transitions. [2024-10-14 03:43:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-14 03:43:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:42,716 INFO L225 Difference]: With dead ends: 1081 [2024-10-14 03:43:42,716 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 03:43:42,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:42,720 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:42,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 378 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 03:43:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2024-10-14 03:43:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.6186556927297668) internal successors, (1180), 729 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1180 transitions. [2024-10-14 03:43:42,757 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1180 transitions. Word has length 60 [2024-10-14 03:43:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:42,759 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1180 transitions. [2024-10-14 03:43:42,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1180 transitions. [2024-10-14 03:43:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 03:43:42,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:42,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:42,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:43:42,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:42,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash -792993450, now seen corresponding path program 1 times [2024-10-14 03:43:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:42,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933646131] [2024-10-14 03:43:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933646131] [2024-10-14 03:43:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933646131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:42,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818855924] [2024-10-14 03:43:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:42,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:42,910 INFO L87 Difference]: Start difference. First operand 730 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:43,080 INFO L93 Difference]: Finished difference Result 3851 states and 6333 transitions. [2024-10-14 03:43:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:43:43,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-14 03:43:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:43,092 INFO L225 Difference]: With dead ends: 3851 [2024-10-14 03:43:43,092 INFO L226 Difference]: Without dead ends: 3197 [2024-10-14 03:43:43,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:43:43,097 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 881 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:43,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1258 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2024-10-14 03:43:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 1360. [2024-10-14 03:43:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.623252391464312) internal successors, (2206), 1359 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2206 transitions. [2024-10-14 03:43:43,136 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2206 transitions. Word has length 62 [2024-10-14 03:43:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2206 transitions. [2024-10-14 03:43:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2206 transitions. [2024-10-14 03:43:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:43:43,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:43,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:43,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:43:43,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1124502626, now seen corresponding path program 1 times [2024-10-14 03:43:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682060306] [2024-10-14 03:43:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:43,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682060306] [2024-10-14 03:43:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682060306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:43,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:43,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:43,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520995585] [2024-10-14 03:43:43,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:43,253 INFO L87 Difference]: Start difference. First operand 1360 states and 2206 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:43,324 INFO L93 Difference]: Finished difference Result 5006 states and 8173 transitions. [2024-10-14 03:43:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:43:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:43,337 INFO L225 Difference]: With dead ends: 5006 [2024-10-14 03:43:43,337 INFO L226 Difference]: Without dead ends: 3724 [2024-10-14 03:43:43,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:43,341 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 379 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:43,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 605 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-10-14 03:43:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 2530. [2024-10-14 03:43:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2529 states have (on average 1.620007908264136) internal successors, (4097), 2529 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 4097 transitions. [2024-10-14 03:43:43,398 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 4097 transitions. Word has length 63 [2024-10-14 03:43:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:43,400 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 4097 transitions. [2024-10-14 03:43:43,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 4097 transitions. [2024-10-14 03:43:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:43:43,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:43,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:43,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:43:43,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:43,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash -808788401, now seen corresponding path program 1 times [2024-10-14 03:43:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419708710] [2024-10-14 03:43:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:43,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:43,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419708710] [2024-10-14 03:43:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419708710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:43,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302562339] [2024-10-14 03:43:43,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:43,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:43,471 INFO L87 Difference]: Start difference. First operand 2530 states and 4097 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:43,502 INFO L93 Difference]: Finished difference Result 4846 states and 7891 transitions. [2024-10-14 03:43:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:43,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:43:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:43,513 INFO L225 Difference]: With dead ends: 4846 [2024-10-14 03:43:43,513 INFO L226 Difference]: Without dead ends: 3486 [2024-10-14 03:43:43,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:43,516 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:43,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2024-10-14 03:43:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3484. [2024-10-14 03:43:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.6138386448463968) internal successors, (5621), 3483 states have internal predecessors, (5621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5621 transitions. [2024-10-14 03:43:43,572 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5621 transitions. Word has length 63 [2024-10-14 03:43:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5621 transitions. [2024-10-14 03:43:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5621 transitions. [2024-10-14 03:43:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:43:43,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:43,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:43,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:43:43,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:43,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1440634225, now seen corresponding path program 1 times [2024-10-14 03:43:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378910380] [2024-10-14 03:43:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:43,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:43,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378910380] [2024-10-14 03:43:43,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378910380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:43,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:43,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216769916] [2024-10-14 03:43:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:43,632 INFO L87 Difference]: Start difference. First operand 3484 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:43,677 INFO L93 Difference]: Finished difference Result 8223 states and 13368 transitions. [2024-10-14 03:43:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:43,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:43:43,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:43,693 INFO L225 Difference]: With dead ends: 8223 [2024-10-14 03:43:43,693 INFO L226 Difference]: Without dead ends: 4820 [2024-10-14 03:43:43,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:43,701 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:43,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 465 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2024-10-14 03:43:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4818. [2024-10-14 03:43:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4818 states, 4817 states have (on average 1.6238322607432012) internal successors, (7822), 4817 states have internal predecessors, (7822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 7822 transitions. [2024-10-14 03:43:43,815 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 7822 transitions. Word has length 63 [2024-10-14 03:43:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:43,816 INFO L471 AbstractCegarLoop]: Abstraction has 4818 states and 7822 transitions. [2024-10-14 03:43:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 7822 transitions. [2024-10-14 03:43:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:43:43,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:43,817 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] [2024-10-14 03:43:43,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:43:43,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 441896861, now seen corresponding path program 1 times [2024-10-14 03:43:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723010717] [2024-10-14 03:43:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723010717] [2024-10-14 03:43:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723010717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488846418] [2024-10-14 03:43:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:43,885 INFO L87 Difference]: Start difference. First operand 4818 states and 7822 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:43,984 INFO L93 Difference]: Finished difference Result 15401 states and 25117 transitions. [2024-10-14 03:43:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-14 03:43:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:44,030 INFO L225 Difference]: With dead ends: 15401 [2024-10-14 03:43:44,030 INFO L226 Difference]: Without dead ends: 10664 [2024-10-14 03:43:44,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:44,045 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:44,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 679 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10664 states. [2024-10-14 03:43:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10664 to 7706. [2024-10-14 03:43:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7706 states, 7705 states have (on average 1.6155743024010383) internal successors, (12448), 7705 states have internal predecessors, (12448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7706 states to 7706 states and 12448 transitions. [2024-10-14 03:43:44,235 INFO L78 Accepts]: Start accepts. Automaton has 7706 states and 12448 transitions. Word has length 64 [2024-10-14 03:43:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:44,236 INFO L471 AbstractCegarLoop]: Abstraction has 7706 states and 12448 transitions. [2024-10-14 03:43:44,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7706 states and 12448 transitions. [2024-10-14 03:43:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:43:44,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:44,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:44,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:43:44,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 760512649, now seen corresponding path program 1 times [2024-10-14 03:43:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141115586] [2024-10-14 03:43:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:44,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141115586] [2024-10-14 03:43:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141115586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023440745] [2024-10-14 03:43:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:44,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:44,303 INFO L87 Difference]: Start difference. First operand 7706 states and 12448 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:44,410 INFO L93 Difference]: Finished difference Result 24293 states and 39381 transitions. [2024-10-14 03:43:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:44,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:43:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:44,438 INFO L225 Difference]: With dead ends: 24293 [2024-10-14 03:43:44,439 INFO L226 Difference]: Without dead ends: 16668 [2024-10-14 03:43:44,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:44,453 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 375 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:44,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 661 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16668 states. [2024-10-14 03:43:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16668 to 12134. [2024-10-14 03:43:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12134 states, 12133 states have (on average 1.6063628121651694) internal successors, (19490), 12133 states have internal predecessors, (19490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12134 states to 12134 states and 19490 transitions. [2024-10-14 03:43:44,757 INFO L78 Accepts]: Start accepts. Automaton has 12134 states and 19490 transitions. Word has length 65 [2024-10-14 03:43:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:44,757 INFO L471 AbstractCegarLoop]: Abstraction has 12134 states and 19490 transitions. [2024-10-14 03:43:44,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 12134 states and 19490 transitions. [2024-10-14 03:43:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:43:44,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:44,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:43:44,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -809096294, now seen corresponding path program 1 times [2024-10-14 03:43:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569349627] [2024-10-14 03:43:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569349627] [2024-10-14 03:43:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569349627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346858865] [2024-10-14 03:43:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:44,943 INFO L87 Difference]: Start difference. First operand 12134 states and 19490 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:45,060 INFO L93 Difference]: Finished difference Result 24189 states and 38870 transitions. [2024-10-14 03:43:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:45,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 03:43:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:45,081 INFO L225 Difference]: With dead ends: 24189 [2024-10-14 03:43:45,081 INFO L226 Difference]: Without dead ends: 12136 [2024-10-14 03:43:45,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:43:45,097 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 105 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:45,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 726 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12136 states. [2024-10-14 03:43:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12136 to 12134. [2024-10-14 03:43:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12134 states, 12133 states have (on average 1.5939998351603066) internal successors, (19340), 12133 states have internal predecessors, (19340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12134 states to 12134 states and 19340 transitions. [2024-10-14 03:43:45,354 INFO L78 Accepts]: Start accepts. Automaton has 12134 states and 19340 transitions. Word has length 67 [2024-10-14 03:43:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:45,354 INFO L471 AbstractCegarLoop]: Abstraction has 12134 states and 19340 transitions. [2024-10-14 03:43:45,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 12134 states and 19340 transitions. [2024-10-14 03:43:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 03:43:45,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:45,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:45,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:43:45,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1815177743, now seen corresponding path program 1 times [2024-10-14 03:43:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219716192] [2024-10-14 03:43:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:45,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:45,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219716192] [2024-10-14 03:43:45,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219716192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:45,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:45,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:45,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858291646] [2024-10-14 03:43:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:45,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:45,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:45,515 INFO L87 Difference]: Start difference. First operand 12134 states and 19340 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:45,717 INFO L93 Difference]: Finished difference Result 34984 states and 55912 transitions. [2024-10-14 03:43:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-14 03:43:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:45,755 INFO L225 Difference]: With dead ends: 34984 [2024-10-14 03:43:45,755 INFO L226 Difference]: Without dead ends: 22931 [2024-10-14 03:43:45,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:43:45,771 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 103 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:45,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 740 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22931 states. [2024-10-14 03:43:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22931 to 22929. [2024-10-14 03:43:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22929 states, 22928 states have (on average 1.58182135380321) internal successors, (36268), 22928 states have internal predecessors, (36268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22929 states to 22929 states and 36268 transitions. [2024-10-14 03:43:46,082 INFO L78 Accepts]: Start accepts. Automaton has 22929 states and 36268 transitions. Word has length 70 [2024-10-14 03:43:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:46,083 INFO L471 AbstractCegarLoop]: Abstraction has 22929 states and 36268 transitions. [2024-10-14 03:43:46,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22929 states and 36268 transitions. [2024-10-14 03:43:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:43:46,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:46,084 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] [2024-10-14 03:43:46,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:43:46,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash 434025879, now seen corresponding path program 1 times [2024-10-14 03:43:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612658737] [2024-10-14 03:43:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612658737] [2024-10-14 03:43:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612658737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624818633] [2024-10-14 03:43:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:46,478 INFO L87 Difference]: Start difference. First operand 22929 states and 36268 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:46,570 INFO L93 Difference]: Finished difference Result 23705 states and 37430 transitions. [2024-10-14 03:43:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:43:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:46,604 INFO L225 Difference]: With dead ends: 23705 [2024-10-14 03:43:46,605 INFO L226 Difference]: Without dead ends: 23703 [2024-10-14 03:43:46,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:46,616 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:46,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23703 states. [2024-10-14 03:43:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23703 to 23703. [2024-10-14 03:43:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23703 states, 23702 states have (on average 1.5624419880178888) internal successors, (37033), 23702 states have internal predecessors, (37033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23703 states to 23703 states and 37033 transitions. [2024-10-14 03:43:46,967 INFO L78 Accepts]: Start accepts. Automaton has 23703 states and 37033 transitions. Word has length 71 [2024-10-14 03:43:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:46,967 INFO L471 AbstractCegarLoop]: Abstraction has 23703 states and 37033 transitions. [2024-10-14 03:43:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23703 states and 37033 transitions. [2024-10-14 03:43:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:43:46,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:46,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:43:46,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:46,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash 575576521, now seen corresponding path program 1 times [2024-10-14 03:43:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023518796] [2024-10-14 03:43:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 03:43:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023518796] [2024-10-14 03:43:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023518796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130558330] [2024-10-14 03:43:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:47,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:47,098 INFO L87 Difference]: Start difference. First operand 23703 states and 37033 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:47,403 INFO L93 Difference]: Finished difference Result 58972 states and 92397 transitions. [2024-10-14 03:43:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 92 [2024-10-14 03:43:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:47,476 INFO L225 Difference]: With dead ends: 58972 [2024-10-14 03:43:47,477 INFO L226 Difference]: Without dead ends: 48118 [2024-10-14 03:43:47,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:43:47,496 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 482 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:47,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 869 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48118 states. [2024-10-14 03:43:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48118 to 37150. [2024-10-14 03:43:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37150 states, 37149 states have (on average 1.5589383294301327) internal successors, (57913), 37149 states have internal predecessors, (57913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37150 states to 37150 states and 57913 transitions. [2024-10-14 03:43:48,188 INFO L78 Accepts]: Start accepts. Automaton has 37150 states and 57913 transitions. Word has length 92 [2024-10-14 03:43:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:48,197 INFO L471 AbstractCegarLoop]: Abstraction has 37150 states and 57913 transitions. [2024-10-14 03:43:48,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37150 states and 57913 transitions. [2024-10-14 03:43:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:43:48,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:48,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:48,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:43:48,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:48,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1946475532, now seen corresponding path program 1 times [2024-10-14 03:43:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:48,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124233045] [2024-10-14 03:43:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:43:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124233045] [2024-10-14 03:43:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124233045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:48,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:48,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402909306] [2024-10-14 03:43:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:48,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:48,358 INFO L87 Difference]: Start difference. First operand 37150 states and 57913 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:48,752 INFO L93 Difference]: Finished difference Result 63284 states and 99189 transitions. [2024-10-14 03:43:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:48,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 92 [2024-10-14 03:43:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:48,841 INFO L225 Difference]: With dead ends: 63284 [2024-10-14 03:43:48,841 INFO L226 Difference]: Without dead ends: 52430 [2024-10-14 03:43:48,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:43:48,863 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 476 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:48,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 940 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52430 states. [2024-10-14 03:43:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52430 to 50260. [2024-10-14 03:43:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50260 states, 50259 states have (on average 1.5600986887920572) internal successors, (78409), 50259 states have internal predecessors, (78409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50260 states to 50260 states and 78409 transitions. [2024-10-14 03:43:49,649 INFO L78 Accepts]: Start accepts. Automaton has 50260 states and 78409 transitions. Word has length 92 [2024-10-14 03:43:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:49,649 INFO L471 AbstractCegarLoop]: Abstraction has 50260 states and 78409 transitions. [2024-10-14 03:43:49,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50260 states and 78409 transitions. [2024-10-14 03:43:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:43:49,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:49,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:49,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:43:49,653 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:49,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 621891858, now seen corresponding path program 1 times [2024-10-14 03:43:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276115249] [2024-10-14 03:43:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:43:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276115249] [2024-10-14 03:43:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276115249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895029783] [2024-10-14 03:43:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:49,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:49,770 INFO L87 Difference]: Start difference. First operand 50260 states and 78409 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:50,180 INFO L93 Difference]: Finished difference Result 74865 states and 117323 transitions. [2024-10-14 03:43:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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 92 [2024-10-14 03:43:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:50,286 INFO L225 Difference]: With dead ends: 74865 [2024-10-14 03:43:50,286 INFO L226 Difference]: Without dead ends: 61158 [2024-10-14 03:43:50,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:43:50,320 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 478 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:50,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 918 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:43:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61158 states. [2024-10-14 03:43:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61158 to 58988. [2024-10-14 03:43:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58988 states, 58987 states have (on average 1.561750894264838) internal successors, (92123), 58987 states have internal predecessors, (92123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58988 states to 58988 states and 92123 transitions. [2024-10-14 03:43:51,156 INFO L78 Accepts]: Start accepts. Automaton has 58988 states and 92123 transitions. Word has length 92 [2024-10-14 03:43:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:51,157 INFO L471 AbstractCegarLoop]: Abstraction has 58988 states and 92123 transitions. [2024-10-14 03:43:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58988 states and 92123 transitions. [2024-10-14 03:43:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:43:51,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:51,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:43:51,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1332792260, now seen corresponding path program 1 times [2024-10-14 03:43:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:51,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458427460] [2024-10-14 03:43:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458427460] [2024-10-14 03:43:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458427460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:51,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906998304] [2024-10-14 03:43:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:51,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:51,272 INFO L87 Difference]: Start difference. First operand 58988 states and 92123 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:51,815 INFO L93 Difference]: Finished difference Result 117466 states and 183705 transitions. [2024-10-14 03:43:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:43:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:51,896 INFO L225 Difference]: With dead ends: 117466 [2024-10-14 03:43:51,897 INFO L226 Difference]: Without dead ends: 58559 [2024-10-14 03:43:51,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:51,940 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 87 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:51,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 431 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58559 states. [2024-10-14 03:43:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58559 to 56581. [2024-10-14 03:43:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56581 states, 56580 states have (on average 1.5629551078119477) internal successors, (88432), 56580 states have internal predecessors, (88432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56581 states to 56581 states and 88432 transitions. [2024-10-14 03:43:52,883 INFO L78 Accepts]: Start accepts. Automaton has 56581 states and 88432 transitions. Word has length 93 [2024-10-14 03:43:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:52,883 INFO L471 AbstractCegarLoop]: Abstraction has 56581 states and 88432 transitions. [2024-10-14 03:43:52,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 56581 states and 88432 transitions. [2024-10-14 03:43:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:43:52,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:52,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:43:52,886 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash -336919691, now seen corresponding path program 1 times [2024-10-14 03:43:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:52,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252859617] [2024-10-14 03:43:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 03:43:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252859617] [2024-10-14 03:43:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252859617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:53,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793964962] [2024-10-14 03:43:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:53,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:53,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:53,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:53,341 INFO L87 Difference]: Start difference. First operand 56581 states and 88432 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:53,647 INFO L93 Difference]: Finished difference Result 132370 states and 208126 transitions. [2024-10-14 03:43:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:43:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:53,837 INFO L225 Difference]: With dead ends: 132370 [2024-10-14 03:43:53,837 INFO L226 Difference]: Without dead ends: 100032 [2024-10-14 03:43:53,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:53,887 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 387 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:53,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 565 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100032 states. [2024-10-14 03:43:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100032 to 86650. [2024-10-14 03:43:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86650 states, 86649 states have (on average 1.5660884718808066) internal successors, (135700), 86649 states have internal predecessors, (135700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86650 states to 86650 states and 135700 transitions. [2024-10-14 03:43:55,277 INFO L78 Accepts]: Start accepts. Automaton has 86650 states and 135700 transitions. Word has length 93 [2024-10-14 03:43:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:55,277 INFO L471 AbstractCegarLoop]: Abstraction has 86650 states and 135700 transitions. [2024-10-14 03:43:55,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 86650 states and 135700 transitions. [2024-10-14 03:43:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:43:55,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:55,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:55,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:43:55,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:55,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1876289132, now seen corresponding path program 1 times [2024-10-14 03:43:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:55,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168395419] [2024-10-14 03:43:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:43:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168395419] [2024-10-14 03:43:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168395419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:55,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:55,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677007154] [2024-10-14 03:43:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:55,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:55,340 INFO L87 Difference]: Start difference. First operand 86650 states and 135700 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:56,252 INFO L93 Difference]: Finished difference Result 204760 states and 321120 transitions. [2024-10-14 03:43:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:43:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:56,486 INFO L225 Difference]: With dead ends: 204760 [2024-10-14 03:43:56,486 INFO L226 Difference]: Without dead ends: 147072 [2024-10-14 03:43:56,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:56,527 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 96 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:56,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 365 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147072 states. [2024-10-14 03:43:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147072 to 146751. [2024-10-14 03:43:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146751 states, 146750 states have (on average 1.5643679727427597) internal successors, (229571), 146750 states have internal predecessors, (229571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146751 states to 146751 states and 229571 transitions. [2024-10-14 03:43:58,885 INFO L78 Accepts]: Start accepts. Automaton has 146751 states and 229571 transitions. Word has length 93 [2024-10-14 03:43:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:58,886 INFO L471 AbstractCegarLoop]: Abstraction has 146751 states and 229571 transitions. [2024-10-14 03:43:58,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 146751 states and 229571 transitions. [2024-10-14 03:43:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:43:58,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:58,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:43:58,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:43:58,887 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2036274214, now seen corresponding path program 1 times [2024-10-14 03:43:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106959824] [2024-10-14 03:43:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:43:58,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106959824] [2024-10-14 03:43:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106959824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:58,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745512682] [2024-10-14 03:43:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:58,984 INFO L87 Difference]: Start difference. First operand 146751 states and 229571 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:59,691 INFO L93 Difference]: Finished difference Result 267282 states and 419462 transitions. [2024-10-14 03:43:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:59,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:43:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:44:00,544 INFO L225 Difference]: With dead ends: 267282 [2024-10-14 03:44:00,544 INFO L226 Difference]: Without dead ends: 204718 [2024-10-14 03:44:00,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:44:00,621 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 212 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:44:00,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 690 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:44:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204718 states. [2024-10-14 03:44:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204718 to 196599. [2024-10-14 03:44:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196599 states, 196598 states have (on average 1.5609110977731209) internal successors, (306872), 196598 states have internal predecessors, (306872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:44:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196599 states to 196599 states and 306872 transitions. [2024-10-14 03:44:03,640 INFO L78 Accepts]: Start accepts. Automaton has 196599 states and 306872 transitions. Word has length 93 [2024-10-14 03:44:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:44:03,641 INFO L471 AbstractCegarLoop]: Abstraction has 196599 states and 306872 transitions. [2024-10-14 03:44:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:44:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 196599 states and 306872 transitions. [2024-10-14 03:44:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:44:03,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:44:03,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:44:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:44:03,643 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:44:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:44:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 102983187, now seen corresponding path program 1 times [2024-10-14 03:44:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:44:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173312078] [2024-10-14 03:44:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:44:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:44:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:44:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:44:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:44:03,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173312078] [2024-10-14 03:44:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173312078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:44:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:44:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:44:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138238244] [2024-10-14 03:44:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:44:03,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:44:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:44:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:44:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:44:03,897 INFO L87 Difference]: Start difference. First operand 196599 states and 306872 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:44:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:44:05,719 INFO L93 Difference]: Finished difference Result 468221 states and 732267 transitions. [2024-10-14 03:44:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:44:05,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:44:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:44:06,360 INFO L225 Difference]: With dead ends: 468221 [2024-10-14 03:44:06,360 INFO L226 Difference]: Without dead ends: 321691 [2024-10-14 03:44:06,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:44:06,491 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 343 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:44:06,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 582 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:44:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321691 states. [2024-10-14 03:44:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321691 to 300693. [2024-10-14 03:44:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300693 states, 300692 states have (on average 1.5598752211565323) internal successors, (469042), 300692 states have internal predecessors, (469042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:44:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300693 states to 300693 states and 469042 transitions. [2024-10-14 03:44:12,342 INFO L78 Accepts]: Start accepts. Automaton has 300693 states and 469042 transitions. Word has length 93 [2024-10-14 03:44:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:44:12,342 INFO L471 AbstractCegarLoop]: Abstraction has 300693 states and 469042 transitions. [2024-10-14 03:44:12,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:44:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 300693 states and 469042 transitions. [2024-10-14 03:44:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:44:12,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:44:12,343 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:44:12,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:44:12,343 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:44:12,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:44:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 420044414, now seen corresponding path program 1 times [2024-10-14 03:44:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:44:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990817057] [2024-10-14 03:44:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:44:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:44:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:44:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:44:12,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:44:12,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990817057] [2024-10-14 03:44:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990817057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:44:12,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:44:12,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:44:12,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244657061] [2024-10-14 03:44:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:44:12,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:44:12,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:44:12,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:44:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:44:12,408 INFO L87 Difference]: Start difference. First operand 300693 states and 469042 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:44:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:44:14,671 INFO L93 Difference]: Finished difference Result 626760 states and 981287 transitions. [2024-10-14 03:44:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:44:14,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-14 03:44:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:44:15,651 INFO L225 Difference]: With dead ends: 626760 [2024-10-14 03:44:15,651 INFO L226 Difference]: Without dead ends: 473771 [2024-10-14 03:44:15,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:44:15,808 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 86 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:44:15,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 369 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:44:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473771 states.