./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.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c42bca5197a9d3789842b36ec154209e56c2a7008fcac4a7338bcb4050288a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:17:08,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:17:08,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:17:08,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:17:08,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:17:08,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:17:08,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:17:08,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:17:08,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:17:08,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:17:08,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:17:08,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:17:08,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:17:08,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:17:08,573 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:17:08,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:17:08,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:17:08,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:17:08,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:17:08,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:17:08,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:17:08,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:17:08,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:17:08,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:17:08,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:17:08,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:17:08,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:17:08,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:17:08,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:17:08,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:17:08,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:17:08,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:17:08,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:17:08,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:17:08,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:17:08,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:17:08,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:17:08,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:17:08,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:17:08,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:17:08,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:17:08,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:17:08,583 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 -> 6c42bca5197a9d3789842b36ec154209e56c2a7008fcac4a7338bcb4050288a1 [2024-10-12 20:17:08,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:17:08,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:17:08,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:17:08,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:17:08,809 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:17:08,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:17:10,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:17:10,247 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:17:10,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:17:10,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac83bbd0b/e9f0fcce731f4b4daf42e77b8fc788b5/FLAG64058dcd3 [2024-10-12 20:17:10,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac83bbd0b/e9f0fcce731f4b4daf42e77b8fc788b5 [2024-10-12 20:17:10,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:17:10,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:17:10,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:17:10,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:17:10,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:17:10,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:17:10" (1/1) ... [2024-10-12 20:17:10,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31955a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:10, skipping insertion in model container [2024-10-12 20:17:10,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:17:10" (1/1) ... [2024-10-12 20:17:10,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:17:11,012 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.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[24502,24515] [2024-10-12 20:17:11,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:17:11,146 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:17:11,242 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.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[24502,24515] [2024-10-12 20:17:11,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:17:11,380 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:17:11,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11 WrapperNode [2024-10-12 20:17:11,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:17:11,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:17:11,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:17:11,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:17:11,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,486 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2318 [2024-10-12 20:17:11,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:17:11,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:17:11,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:17:11,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:17:11,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:17:11,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:17:11,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:17:11,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:17:11,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:17:11,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (1/1) ... [2024-10-12 20:17:11,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:17:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:17:11,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:17:11,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:17:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:17:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:17:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:17:11,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:17:11,826 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:17:11,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:17:13,207 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2024-10-12 20:17:13,208 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:17:13,266 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:17:13,267 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:17:13,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:17:13 BoogieIcfgContainer [2024-10-12 20:17:13,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:17:13,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:17:13,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:17:13,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:17:13,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:17:10" (1/3) ... [2024-10-12 20:17:13,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1fc461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:17:13, skipping insertion in model container [2024-10-12 20:17:13,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:17:11" (2/3) ... [2024-10-12 20:17:13,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1fc461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:17:13, skipping insertion in model container [2024-10-12 20:17:13,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:17:13" (3/3) ... [2024-10-12 20:17:13,276 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:17:13,290 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:17:13,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:17:13,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:17:13,372 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;@3c63dba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:17:13,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:17:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.7908163265306123) internal successors, (1053), 589 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-12 20:17:13,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:13,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1583194630, now seen corresponding path program 1 times [2024-10-12 20:17:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565596640] [2024-10-12 20:17:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565596640] [2024-10-12 20:17:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565596640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:14,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:14,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262027913] [2024-10-12 20:17:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:14,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:14,105 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.7908163265306123) internal successors, (1053), 589 states have internal predecessors, (1053), 0 states have call successors, (0), 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 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:14,294 INFO L93 Difference]: Finished difference Result 1080 states and 1913 transitions. [2024-10-12 20:17:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:14,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2024-10-12 20:17:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:14,323 INFO L225 Difference]: With dead ends: 1080 [2024-10-12 20:17:14,325 INFO L226 Difference]: Without dead ends: 900 [2024-10-12 20:17:14,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:14,335 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 592 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:14,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1825 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:17:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-10-12 20:17:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 898. [2024-10-12 20:17:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 1.5707915273132664) internal successors, (1409), 897 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1409 transitions. [2024-10-12 20:17:14,402 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1409 transitions. Word has length 237 [2024-10-12 20:17:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:14,403 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1409 transitions. [2024-10-12 20:17:14,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1409 transitions. [2024-10-12 20:17:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-12 20:17:14,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:14,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:14,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:17:14,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1073961202, now seen corresponding path program 1 times [2024-10-12 20:17:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109581278] [2024-10-12 20:17:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109581278] [2024-10-12 20:17:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109581278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103452642] [2024-10-12 20:17:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:17:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:17:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:15,227 INFO L87 Difference]: Start difference. First operand 898 states and 1409 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:15,392 INFO L93 Difference]: Finished difference Result 3468 states and 5420 transitions. [2024-10-12 20:17:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:17:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2024-10-12 20:17:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:15,403 INFO L225 Difference]: With dead ends: 3468 [2024-10-12 20:17:15,403 INFO L226 Difference]: Without dead ends: 2616 [2024-10-12 20:17:15,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12 20:17:15,410 INFO L432 NwaCegarLoop]: 1477 mSDtfsCounter, 1681 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:15,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 3195 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:17:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2024-10-12 20:17:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 1760. [2024-10-12 20:17:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1759 states have (on average 1.5605457646389995) internal successors, (2745), 1759 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2745 transitions. [2024-10-12 20:17:15,459 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2745 transitions. Word has length 237 [2024-10-12 20:17:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:15,460 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2745 transitions. [2024-10-12 20:17:15,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2745 transitions. [2024-10-12 20:17:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-12 20:17:15,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:15,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:15,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:17:15,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash -706549838, now seen corresponding path program 1 times [2024-10-12 20:17:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692391372] [2024-10-12 20:17:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:15,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692391372] [2024-10-12 20:17:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692391372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:15,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:15,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:15,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775936315] [2024-10-12 20:17:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:15,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:15,676 INFO L87 Difference]: Start difference. First operand 1760 states and 2745 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:15,759 INFO L93 Difference]: Finished difference Result 5095 states and 7910 transitions. [2024-10-12 20:17:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:15,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-10-12 20:17:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:15,771 INFO L225 Difference]: With dead ends: 5095 [2024-10-12 20:17:15,771 INFO L226 Difference]: Without dead ends: 3459 [2024-10-12 20:17:15,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:15,774 INFO L432 NwaCegarLoop]: 1732 mSDtfsCounter, 790 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:15,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2610 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:17:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2024-10-12 20:17:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3457. [2024-10-12 20:17:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3457 states, 3456 states have (on average 1.5512152777777777) internal successors, (5361), 3456 states have internal predecessors, (5361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 5361 transitions. [2024-10-12 20:17:15,832 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 5361 transitions. Word has length 239 [2024-10-12 20:17:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:15,833 INFO L471 AbstractCegarLoop]: Abstraction has 3457 states and 5361 transitions. [2024-10-12 20:17:15,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 5361 transitions. [2024-10-12 20:17:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-12 20:17:15,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:15,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:15,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:17:15,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:15,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1372922487, now seen corresponding path program 1 times [2024-10-12 20:17:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638969741] [2024-10-12 20:17:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638969741] [2024-10-12 20:17:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638969741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:15,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781854829] [2024-10-12 20:17:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:15,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:15,949 INFO L87 Difference]: Start difference. First operand 3457 states and 5361 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:16,015 INFO L93 Difference]: Finished difference Result 10306 states and 15964 transitions. [2024-10-12 20:17:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-10-12 20:17:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:16,033 INFO L225 Difference]: With dead ends: 10306 [2024-10-12 20:17:16,034 INFO L226 Difference]: Without dead ends: 6886 [2024-10-12 20:17:16,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:16,042 INFO L432 NwaCegarLoop]: 1820 mSDtfsCounter, 908 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:16,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2728 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2024-10-12 20:17:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 3476. [2024-10-12 20:17:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 1.5510791366906476) internal successors, (5390), 3475 states have internal predecessors, (5390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5390 transitions. [2024-10-12 20:17:16,114 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5390 transitions. Word has length 239 [2024-10-12 20:17:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:16,115 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5390 transitions. [2024-10-12 20:17:16,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5390 transitions. [2024-10-12 20:17:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-12 20:17:16,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:16,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:16,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:17:16,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1138250706, now seen corresponding path program 1 times [2024-10-12 20:17:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200248882] [2024-10-12 20:17:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200248882] [2024-10-12 20:17:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200248882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516333820] [2024-10-12 20:17:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:16,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:16,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:16,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:16,221 INFO L87 Difference]: Start difference. First operand 3476 states and 5390 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:16,276 INFO L93 Difference]: Finished difference Result 6915 states and 10711 transitions. [2024-10-12 20:17:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2024-10-12 20:17:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:16,285 INFO L225 Difference]: With dead ends: 6915 [2024-10-12 20:17:16,285 INFO L226 Difference]: Without dead ends: 3494 [2024-10-12 20:17:16,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:16,289 INFO L432 NwaCegarLoop]: 930 mSDtfsCounter, 5 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:16,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1846 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-12 20:17:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2024-10-12 20:17:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 3493 states have (on average 1.5490981963927857) internal successors, (5411), 3493 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5411 transitions. [2024-10-12 20:17:16,341 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5411 transitions. Word has length 240 [2024-10-12 20:17:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:16,342 INFO L471 AbstractCegarLoop]: Abstraction has 3494 states and 5411 transitions. [2024-10-12 20:17:16,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5411 transitions. [2024-10-12 20:17:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 20:17:16,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:16,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:16,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:17:16,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:16,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash 893369293, now seen corresponding path program 1 times [2024-10-12 20:17:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90174608] [2024-10-12 20:17:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:16,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:16,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:16,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90174608] [2024-10-12 20:17:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90174608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522526582] [2024-10-12 20:17:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:16,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:16,473 INFO L87 Difference]: Start difference. First operand 3494 states and 5411 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:16,547 INFO L93 Difference]: Finished difference Result 10025 states and 15453 transitions. [2024-10-12 20:17:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:16,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-10-12 20:17:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:16,565 INFO L225 Difference]: With dead ends: 10025 [2024-10-12 20:17:16,565 INFO L226 Difference]: Without dead ends: 6771 [2024-10-12 20:17:16,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:16,571 INFO L432 NwaCegarLoop]: 1792 mSDtfsCounter, 783 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:16,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2670 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2024-10-12 20:17:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 6769. [2024-10-12 20:17:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6769 states, 6768 states have (on average 1.5372340425531914) internal successors, (10404), 6768 states have internal predecessors, (10404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 10404 transitions. [2024-10-12 20:17:16,704 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 10404 transitions. Word has length 241 [2024-10-12 20:17:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:16,704 INFO L471 AbstractCegarLoop]: Abstraction has 6769 states and 10404 transitions. [2024-10-12 20:17:16,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 10404 transitions. [2024-10-12 20:17:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 20:17:16,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:16,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:17:16,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash 540458986, now seen corresponding path program 1 times [2024-10-12 20:17:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:16,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486100874] [2024-10-12 20:17:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:17,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486100874] [2024-10-12 20:17:17,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486100874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:17,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:17,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:17:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72699819] [2024-10-12 20:17:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:17,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:17:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:17,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:17:17,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:17,379 INFO L87 Difference]: Start difference. First operand 6769 states and 10404 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:17,471 INFO L93 Difference]: Finished difference Result 19376 states and 29579 transitions. [2024-10-12 20:17:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:17:17,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-10-12 20:17:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:17,492 INFO L225 Difference]: With dead ends: 19376 [2024-10-12 20:17:17,493 INFO L226 Difference]: Without dead ends: 13142 [2024-10-12 20:17:17,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:17,504 INFO L432 NwaCegarLoop]: 1467 mSDtfsCounter, 877 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:17,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 3843 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13142 states. [2024-10-12 20:17:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13142 to 7004. [2024-10-12 20:17:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 7003 states have (on average 1.5411966300157076) internal successors, (10793), 7003 states have internal predecessors, (10793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 10793 transitions. [2024-10-12 20:17:17,651 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 10793 transitions. Word has length 241 [2024-10-12 20:17:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:17,651 INFO L471 AbstractCegarLoop]: Abstraction has 7004 states and 10793 transitions. [2024-10-12 20:17:17,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 10793 transitions. [2024-10-12 20:17:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-12 20:17:17,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:17,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:17,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:17:17,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:17,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -148560053, now seen corresponding path program 1 times [2024-10-12 20:17:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526250213] [2024-10-12 20:17:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526250213] [2024-10-12 20:17:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526250213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:17,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:17,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698268560] [2024-10-12 20:17:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:17,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:17,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:17,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:17,766 INFO L87 Difference]: Start difference. First operand 7004 states and 10793 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:17,830 INFO L93 Difference]: Finished difference Result 19452 states and 29658 transitions. [2024-10-12 20:17:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2024-10-12 20:17:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:17,853 INFO L225 Difference]: With dead ends: 19452 [2024-10-12 20:17:17,854 INFO L226 Difference]: Without dead ends: 13246 [2024-10-12 20:17:17,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:17,866 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 776 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:17,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 2595 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13246 states. [2024-10-12 20:17:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13246 to 7108. [2024-10-12 20:17:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 7107 states have (on average 1.5387645982833826) internal successors, (10936), 7107 states have internal predecessors, (10936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 10936 transitions. [2024-10-12 20:17:17,984 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 10936 transitions. Word has length 243 [2024-10-12 20:17:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:17,985 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 10936 transitions. [2024-10-12 20:17:17,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 10936 transitions. [2024-10-12 20:17:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-12 20:17:17,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:17,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:17:17,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1666122010, now seen corresponding path program 1 times [2024-10-12 20:17:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037652159] [2024-10-12 20:17:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:18,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:18,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037652159] [2024-10-12 20:17:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037652159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114983918] [2024-10-12 20:17:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:18,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:18,111 INFO L87 Difference]: Start difference. First operand 7108 states and 10936 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:18,156 INFO L93 Difference]: Finished difference Result 13446 states and 20531 transitions. [2024-10-12 20:17:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:18,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-10-12 20:17:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:18,166 INFO L225 Difference]: With dead ends: 13446 [2024-10-12 20:17:18,167 INFO L226 Difference]: Without dead ends: 7233 [2024-10-12 20:17:18,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:18,175 INFO L432 NwaCegarLoop]: 930 mSDtfsCounter, 5 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:18,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1845 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7233 states. [2024-10-12 20:17:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7233 to 7233. [2024-10-12 20:17:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7233 states, 7232 states have (on average 1.5323561946902655) internal successors, (11082), 7232 states have internal predecessors, (11082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 11082 transitions. [2024-10-12 20:17:18,261 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 11082 transitions. Word has length 244 [2024-10-12 20:17:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:18,261 INFO L471 AbstractCegarLoop]: Abstraction has 7233 states and 11082 transitions. [2024-10-12 20:17:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 11082 transitions. [2024-10-12 20:17:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-12 20:17:18,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:18,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:18,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:17:18,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1329146434, now seen corresponding path program 1 times [2024-10-12 20:17:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096211287] [2024-10-12 20:17:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096211287] [2024-10-12 20:17:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096211287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:18,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:18,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:17:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421544256] [2024-10-12 20:17:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:17:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:17:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:17:18,725 INFO L87 Difference]: Start difference. First operand 7233 states and 11082 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:18,925 INFO L93 Difference]: Finished difference Result 34945 states and 53388 transitions. [2024-10-12 20:17:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:17:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2024-10-12 20:17:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:18,967 INFO L225 Difference]: With dead ends: 34945 [2024-10-12 20:17:18,968 INFO L226 Difference]: Without dead ends: 27779 [2024-10-12 20:17:18,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:17:18,987 INFO L432 NwaCegarLoop]: 1959 mSDtfsCounter, 3065 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 5407 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:18,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 5407 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:17:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27779 states. [2024-10-12 20:17:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27779 to 13942. [2024-10-12 20:17:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13942 states, 13941 states have (on average 1.5178251201492001) internal successors, (21160), 13941 states have internal predecessors, (21160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13942 states to 13942 states and 21160 transitions. [2024-10-12 20:17:19,386 INFO L78 Accepts]: Start accepts. Automaton has 13942 states and 21160 transitions. Word has length 245 [2024-10-12 20:17:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:19,387 INFO L471 AbstractCegarLoop]: Abstraction has 13942 states and 21160 transitions. [2024-10-12 20:17:19,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13942 states and 21160 transitions. [2024-10-12 20:17:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-12 20:17:19,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:19,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:19,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:17:19,405 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1225631628, now seen corresponding path program 1 times [2024-10-12 20:17:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611478646] [2024-10-12 20:17:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611478646] [2024-10-12 20:17:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611478646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:17:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330453965] [2024-10-12 20:17:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:19,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:17:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:17:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:19,974 INFO L87 Difference]: Start difference. First operand 13942 states and 21160 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:20,081 INFO L93 Difference]: Finished difference Result 39961 states and 60420 transitions. [2024-10-12 20:17:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:17:20,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-10-12 20:17:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:20,124 INFO L225 Difference]: With dead ends: 39961 [2024-10-12 20:17:20,124 INFO L226 Difference]: Without dead ends: 27301 [2024-10-12 20:17:20,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:20,144 INFO L432 NwaCegarLoop]: 1808 mSDtfsCounter, 866 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:20,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 4525 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27301 states. [2024-10-12 20:17:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27301 to 14711. [2024-10-12 20:17:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14711 states, 14710 states have (on average 1.527668252889191) internal successors, (22472), 14710 states have internal predecessors, (22472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14711 states to 14711 states and 22472 transitions. [2024-10-12 20:17:20,445 INFO L78 Accepts]: Start accepts. Automaton has 14711 states and 22472 transitions. Word has length 247 [2024-10-12 20:17:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:20,446 INFO L471 AbstractCegarLoop]: Abstraction has 14711 states and 22472 transitions. [2024-10-12 20:17:20,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14711 states and 22472 transitions. [2024-10-12 20:17:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-12 20:17:20,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:20,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:17:20,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:20,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -15613014, now seen corresponding path program 1 times [2024-10-12 20:17:20,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:20,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099019862] [2024-10-12 20:17:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099019862] [2024-10-12 20:17:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099019862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:20,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:20,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007280338] [2024-10-12 20:17:20,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:20,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:20,582 INFO L87 Difference]: Start difference. First operand 14711 states and 22472 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:20,704 INFO L93 Difference]: Finished difference Result 41461 states and 62878 transitions. [2024-10-12 20:17:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-10-12 20:17:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:20,747 INFO L225 Difference]: With dead ends: 41461 [2024-10-12 20:17:20,748 INFO L226 Difference]: Without dead ends: 28211 [2024-10-12 20:17:20,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:20,767 INFO L432 NwaCegarLoop]: 1778 mSDtfsCounter, 766 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:20,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 2656 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28211 states. [2024-10-12 20:17:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28211 to 28209. [2024-10-12 20:17:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28209 states, 28208 states have (on average 1.513116846284742) internal successors, (42682), 28208 states have internal predecessors, (42682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28209 states to 28209 states and 42682 transitions. [2024-10-12 20:17:21,140 INFO L78 Accepts]: Start accepts. Automaton has 28209 states and 42682 transitions. Word has length 247 [2024-10-12 20:17:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:21,140 INFO L471 AbstractCegarLoop]: Abstraction has 28209 states and 42682 transitions. [2024-10-12 20:17:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28209 states and 42682 transitions. [2024-10-12 20:17:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-12 20:17:21,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:21,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:21,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:17:21,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:21,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -120996956, now seen corresponding path program 1 times [2024-10-12 20:17:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:21,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274551010] [2024-10-12 20:17:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:21,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274551010] [2024-10-12 20:17:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274551010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:21,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:21,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880850618] [2024-10-12 20:17:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:21,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:21,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:21,292 INFO L87 Difference]: Start difference. First operand 28209 states and 42682 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:21,615 INFO L93 Difference]: Finished difference Result 77491 states and 116005 transitions. [2024-10-12 20:17:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-10-12 20:17:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:21,700 INFO L225 Difference]: With dead ends: 77491 [2024-10-12 20:17:21,700 INFO L226 Difference]: Without dead ends: 53193 [2024-10-12 20:17:21,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:21,728 INFO L432 NwaCegarLoop]: 1770 mSDtfsCounter, 778 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:21,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 2648 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53193 states. [2024-10-12 20:17:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53193 to 53191. [2024-10-12 20:17:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53191 states, 53190 states have (on average 1.4924797894341042) internal successors, (79385), 53190 states have internal predecessors, (79385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53191 states to 53191 states and 79385 transitions. [2024-10-12 20:17:22,454 INFO L78 Accepts]: Start accepts. Automaton has 53191 states and 79385 transitions. Word has length 247 [2024-10-12 20:17:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:22,456 INFO L471 AbstractCegarLoop]: Abstraction has 53191 states and 79385 transitions. [2024-10-12 20:17:22,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 53191 states and 79385 transitions. [2024-10-12 20:17:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-12 20:17:22,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:22,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:22,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:17:22,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:22,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 492786834, now seen corresponding path program 1 times [2024-10-12 20:17:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304756985] [2024-10-12 20:17:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304756985] [2024-10-12 20:17:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304756985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:23,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:23,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:17:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58166589] [2024-10-12 20:17:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:17:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:17:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:23,222 INFO L87 Difference]: Start difference. First operand 53191 states and 79385 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:23,412 INFO L93 Difference]: Finished difference Result 93128 states and 138474 transitions. [2024-10-12 20:17:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:17:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2024-10-12 20:17:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:23,467 INFO L225 Difference]: With dead ends: 93128 [2024-10-12 20:17:23,468 INFO L226 Difference]: Without dead ends: 45646 [2024-10-12 20:17:23,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:23,505 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 85 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 3002 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:23,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 3002 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45646 states. [2024-10-12 20:17:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45646 to 45038. [2024-10-12 20:17:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45038 states, 45037 states have (on average 1.4923285298754358) internal successors, (67210), 45037 states have internal predecessors, (67210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45038 states to 45038 states and 67210 transitions. [2024-10-12 20:17:24,293 INFO L78 Accepts]: Start accepts. Automaton has 45038 states and 67210 transitions. Word has length 249 [2024-10-12 20:17:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:24,293 INFO L471 AbstractCegarLoop]: Abstraction has 45038 states and 67210 transitions. [2024-10-12 20:17:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 45038 states and 67210 transitions. [2024-10-12 20:17:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 20:17:24,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:24,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:24,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:17:24,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash -731371240, now seen corresponding path program 1 times [2024-10-12 20:17:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605465476] [2024-10-12 20:17:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605465476] [2024-10-12 20:17:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605465476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:24,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180025248] [2024-10-12 20:17:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:24,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:24,439 INFO L87 Difference]: Start difference. First operand 45038 states and 67210 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:25,140 INFO L93 Difference]: Finished difference Result 107731 states and 160833 transitions. [2024-10-12 20:17:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2024-10-12 20:17:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:25,211 INFO L225 Difference]: With dead ends: 107731 [2024-10-12 20:17:25,212 INFO L226 Difference]: Without dead ends: 76147 [2024-10-12 20:17:25,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:25,244 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 515 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:25,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1515 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:17:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76147 states. [2024-10-12 20:17:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76147 to 76145. [2024-10-12 20:17:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76145 states, 76144 states have (on average 1.4852122294599706) internal successors, (113090), 76144 states have internal predecessors, (113090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76145 states to 76145 states and 113090 transitions. [2024-10-12 20:17:26,413 INFO L78 Accepts]: Start accepts. Automaton has 76145 states and 113090 transitions. Word has length 253 [2024-10-12 20:17:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:26,414 INFO L471 AbstractCegarLoop]: Abstraction has 76145 states and 113090 transitions. [2024-10-12 20:17:26,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76145 states and 113090 transitions. [2024-10-12 20:17:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 20:17:26,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:26,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:26,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:17:26,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:26,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -879897837, now seen corresponding path program 1 times [2024-10-12 20:17:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:26,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999109345] [2024-10-12 20:17:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:27,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999109345] [2024-10-12 20:17:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999109345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:27,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:27,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:17:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038010938] [2024-10-12 20:17:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:17:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:17:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:27,064 INFO L87 Difference]: Start difference. First operand 76145 states and 113090 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:27,452 INFO L93 Difference]: Finished difference Result 139595 states and 206648 transitions. [2024-10-12 20:17:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:17:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2024-10-12 20:17:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:27,525 INFO L225 Difference]: With dead ends: 139595 [2024-10-12 20:17:27,525 INFO L226 Difference]: Without dead ends: 68201 [2024-10-12 20:17:27,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:27,559 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 97 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:27,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 3018 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68201 states. [2024-10-12 20:17:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68201 to 67907. [2024-10-12 20:17:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67907 states, 67906 states have (on average 1.4849497835242835) internal successors, (100837), 67906 states have internal predecessors, (100837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67907 states to 67907 states and 100837 transitions. [2024-10-12 20:17:28,780 INFO L78 Accepts]: Start accepts. Automaton has 67907 states and 100837 transitions. Word has length 253 [2024-10-12 20:17:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:28,780 INFO L471 AbstractCegarLoop]: Abstraction has 67907 states and 100837 transitions. [2024-10-12 20:17:28,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 67907 states and 100837 transitions. [2024-10-12 20:17:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 20:17:28,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:28,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:28,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:17:28,829 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -471170134, now seen corresponding path program 1 times [2024-10-12 20:17:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798344620] [2024-10-12 20:17:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798344620] [2024-10-12 20:17:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798344620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:30,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-12 20:17:30,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061050745] [2024-10-12 20:17:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:17:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:17:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:17:30,142 INFO L87 Difference]: Start difference. First operand 67907 states and 100837 transitions. Second operand has 16 states, 16 states have (on average 15.8125) internal successors, (253), 15 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:31,678 INFO L93 Difference]: Finished difference Result 120315 states and 180902 transitions. [2024-10-12 20:17:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 20:17:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.8125) internal successors, (253), 15 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2024-10-12 20:17:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:31,796 INFO L225 Difference]: With dead ends: 120315 [2024-10-12 20:17:31,797 INFO L226 Difference]: Without dead ends: 104177 [2024-10-12 20:17:31,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:17:31,838 INFO L432 NwaCegarLoop]: 1200 mSDtfsCounter, 7157 mSDsluCounter, 12082 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7157 SdHoareTripleChecker+Valid, 13282 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:31,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7157 Valid, 13282 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:17:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104177 states. [2024-10-12 20:17:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104177 to 74051. [2024-10-12 20:17:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74051 states, 74050 states have (on average 1.4743146522619852) internal successors, (109173), 74050 states have internal predecessors, (109173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74051 states to 74051 states and 109173 transitions. [2024-10-12 20:17:33,296 INFO L78 Accepts]: Start accepts. Automaton has 74051 states and 109173 transitions. Word has length 253 [2024-10-12 20:17:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:33,297 INFO L471 AbstractCegarLoop]: Abstraction has 74051 states and 109173 transitions. [2024-10-12 20:17:33,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.8125) internal successors, (253), 15 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 74051 states and 109173 transitions. [2024-10-12 20:17:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 20:17:33,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:33,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:17:33,342 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:33,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:33,342 INFO L85 PathProgramCache]: Analyzing trace with hash 731003256, now seen corresponding path program 1 times [2024-10-12 20:17:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957504516] [2024-10-12 20:17:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:33,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:33,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957504516] [2024-10-12 20:17:33,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957504516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:33,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916502172] [2024-10-12 20:17:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:33,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:17:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:17:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:17:33,726 INFO L87 Difference]: Start difference. First operand 74051 states and 109173 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:34,451 INFO L93 Difference]: Finished difference Result 210876 states and 310518 transitions. [2024-10-12 20:17:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:17:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2024-10-12 20:17:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:34,621 INFO L225 Difference]: With dead ends: 210876 [2024-10-12 20:17:34,621 INFO L226 Difference]: Without dead ends: 137038 [2024-10-12 20:17:34,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 20:17:34,699 INFO L432 NwaCegarLoop]: 1476 mSDtfsCounter, 805 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3775 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:34,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3775 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:17:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137038 states. [2024-10-12 20:17:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137038 to 137036. [2024-10-12 20:17:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137036 states, 137035 states have (on average 1.4625241726566205) internal successors, (200417), 137035 states have internal predecessors, (200417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137036 states to 137036 states and 200417 transitions. [2024-10-12 20:17:36,649 INFO L78 Accepts]: Start accepts. Automaton has 137036 states and 200417 transitions. Word has length 253 [2024-10-12 20:17:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:36,650 INFO L471 AbstractCegarLoop]: Abstraction has 137036 states and 200417 transitions. [2024-10-12 20:17:36,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 137036 states and 200417 transitions. [2024-10-12 20:17:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-12 20:17:36,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:36,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:36,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:17:36,757 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:36,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1341260466, now seen corresponding path program 1 times [2024-10-12 20:17:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654065500] [2024-10-12 20:17:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:36,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654065500] [2024-10-12 20:17:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654065500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:36,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:36,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495570164] [2024-10-12 20:17:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:36,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:36,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:36,899 INFO L87 Difference]: Start difference. First operand 137036 states and 200417 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:38,241 INFO L93 Difference]: Finished difference Result 400437 states and 583846 transitions. [2024-10-12 20:17:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:38,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2024-10-12 20:17:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:38,578 INFO L225 Difference]: With dead ends: 400437 [2024-10-12 20:17:38,578 INFO L226 Difference]: Without dead ends: 267820 [2024-10-12 20:17:39,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:39,237 INFO L432 NwaCegarLoop]: 1738 mSDtfsCounter, 765 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:39,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2612 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:17:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267820 states. [2024-10-12 20:17:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267820 to 267755. [2024-10-12 20:17:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267755 states, 267754 states have (on average 1.450095983626762) internal successors, (388269), 267754 states have internal predecessors, (388269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267755 states to 267755 states and 388269 transitions. [2024-10-12 20:17:42,933 INFO L78 Accepts]: Start accepts. Automaton has 267755 states and 388269 transitions. Word has length 255 [2024-10-12 20:17:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:42,934 INFO L471 AbstractCegarLoop]: Abstraction has 267755 states and 388269 transitions. [2024-10-12 20:17:42,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 267755 states and 388269 transitions. [2024-10-12 20:17:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-12 20:17:43,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:43,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:43,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:17:43,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:43,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1439779248, now seen corresponding path program 1 times [2024-10-12 20:17:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:43,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221042395] [2024-10-12 20:17:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:43,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221042395] [2024-10-12 20:17:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221042395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:43,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439827409] [2024-10-12 20:17:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:43,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:43,189 INFO L87 Difference]: Start difference. First operand 267755 states and 388269 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:17:45,491 INFO L93 Difference]: Finished difference Result 531267 states and 767051 transitions. [2024-10-12 20:17:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:17:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2024-10-12 20:17:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:17:45,980 INFO L225 Difference]: With dead ends: 531267 [2024-10-12 20:17:45,981 INFO L226 Difference]: Without dead ends: 356715 [2024-10-12 20:17:46,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:46,094 INFO L432 NwaCegarLoop]: 1439 mSDtfsCounter, 875 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:17:46,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 2349 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:17:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356715 states. [2024-10-12 20:17:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356715 to 267755. [2024-10-12 20:17:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267755 states, 267754 states have (on average 1.4500735749979459) internal successors, (388263), 267754 states have internal predecessors, (388263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267755 states to 267755 states and 388263 transitions. [2024-10-12 20:17:50,340 INFO L78 Accepts]: Start accepts. Automaton has 267755 states and 388263 transitions. Word has length 256 [2024-10-12 20:17:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:50,340 INFO L471 AbstractCegarLoop]: Abstraction has 267755 states and 388263 transitions. [2024-10-12 20:17:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:17:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 267755 states and 388263 transitions. [2024-10-12 20:17:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-12 20:17:51,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:51,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:17:51,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:17:51,293 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:51,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1385441459, now seen corresponding path program 1 times [2024-10-12 20:17:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:51,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579139281] [2024-10-12 20:17:51,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:51,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:17:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579139281] [2024-10-12 20:17:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579139281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:17:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410795405] [2024-10-12 20:17:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:51,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:17:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:17:51,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:17:51,403 INFO L87 Difference]: Start difference. First operand 267755 states and 388263 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)