./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.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 6c7bda6ec8155a470f5f9e07367696d7e5cc6867667668ebd692704e4077816f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:13:20,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:13:20,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:13:20,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:13:20,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:13:20,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:13:20,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:13:20,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:13:20,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:13:20,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:13:20,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:13:20,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:13:20,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:13:20,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:13:20,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:13:20,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:13:20,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:13:20,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:13:20,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:13:20,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:13:20,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:13:20,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:13:20,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:13:20,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:13:20,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:13:20,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:13:20,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:13:20,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:13:20,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:13:20,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:13:20,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:13:20,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:13:20,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:13:20,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:13:20,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:13:20,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:13:20,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:13:20,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:13:20,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:13:20,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:13:20,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:13:20,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:13:20,513 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 -> 6c7bda6ec8155a470f5f9e07367696d7e5cc6867667668ebd692704e4077816f [2024-11-16 08:13:20,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:13:20,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:13:20,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:13:20,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:13:20,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:13:20,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2024-11-16 08:13:22,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:13:22,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:13:22,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2024-11-16 08:13:22,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef07faa6c/c8ea149c6e56461aaf22a484567993f1/FLAG26045bf70 [2024-11-16 08:13:22,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef07faa6c/c8ea149c6e56461aaf22a484567993f1 [2024-11-16 08:13:22,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:13:22,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:13:22,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:13:22,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:13:22,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:13:22,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:13:22" (1/1) ... [2024-11-16 08:13:22,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:22, skipping insertion in model container [2024-11-16 08:13:22,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:13:22" (1/1) ... [2024-11-16 08:13:22,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:13:23,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2024-11-16 08:13:23,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:13:23,257 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:13:23,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2024-11-16 08:13:23,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:13:23,378 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:13:23,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23 WrapperNode [2024-11-16 08:13:23,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:13:23,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:13:23,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:13:23,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:13:23,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,493 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 957 [2024-11-16 08:13:23,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:13:23,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:13:23,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:13:23,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:13:23,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,535 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-11-16 08:13:23,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:13:23,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:13:23,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:13:23,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:13:23,597 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (1/1) ... [2024-11-16 08:13:23,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:13:23,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:13:23,640 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-11-16 08:13:23,643 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-11-16 08:13:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:13:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:13:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:13:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:13:23,878 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:13:23,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:13:24,709 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-16 08:13:24,710 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:13:24,730 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:13:24,730 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:13:24,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:13:24 BoogieIcfgContainer [2024-11-16 08:13:24,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:13:24,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:13:24,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:13:24,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:13:24,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:13:22" (1/3) ... [2024-11-16 08:13:24,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee13b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:13:24, skipping insertion in model container [2024-11-16 08:13:24,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:23" (2/3) ... [2024-11-16 08:13:24,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee13b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:13:24, skipping insertion in model container [2024-11-16 08:13:24,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:13:24" (3/3) ... [2024-11-16 08:13:24,743 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c [2024-11-16 08:13:24,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:13:24,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:13:24,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:13:24,832 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;@7162a838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:13:24,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:13:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 308 states have (on average 1.7532467532467533) internal successors, (540), 309 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 08:13:24,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:24,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:13:24,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:24,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1106129407, now seen corresponding path program 1 times [2024-11-16 08:13:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086841452] [2024-11-16 08:13:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:25,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086841452] [2024-11-16 08:13:25,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086841452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:25,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:25,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 08:13:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120217690] [2024-11-16 08:13:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:25,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 08:13:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 08:13:25,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:13:25,466 INFO L87 Difference]: Start difference. First operand has 310 states, 308 states have (on average 1.7532467532467533) internal successors, (540), 309 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:25,516 INFO L93 Difference]: Finished difference Result 404 states and 701 transitions. [2024-11-16 08:13:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 08:13:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-16 08:13:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:25,532 INFO L225 Difference]: With dead ends: 404 [2024-11-16 08:13:25,532 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 08:13:25,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:13:25,537 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:25,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 08:13:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-16 08:13:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.75) internal successors, (532), 304 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 532 transitions. [2024-11-16 08:13:25,591 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 532 transitions. Word has length 79 [2024-11-16 08:13:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:25,592 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 532 transitions. [2024-11-16 08:13:25,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 532 transitions. [2024-11-16 08:13:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 08:13:25,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:25,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:13:25,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:13:25,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1075109600, now seen corresponding path program 1 times [2024-11-16 08:13:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:25,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147864097] [2024-11-16 08:13:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147864097] [2024-11-16 08:13:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147864097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:26,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:13:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452947302] [2024-11-16 08:13:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:13:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:13:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:13:26,064 INFO L87 Difference]: Start difference. First operand 305 states and 532 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:26,210 INFO L93 Difference]: Finished difference Result 398 states and 690 transitions. [2024-11-16 08:13:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:13:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-16 08:13:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:26,215 INFO L225 Difference]: With dead ends: 398 [2024-11-16 08:13:26,217 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 08:13:26,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:13:26,219 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:26,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2073 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 08:13:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-16 08:13:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.611842105263158) internal successors, (490), 304 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 490 transitions. [2024-11-16 08:13:26,245 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 490 transitions. Word has length 79 [2024-11-16 08:13:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:26,245 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 490 transitions. [2024-11-16 08:13:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 490 transitions. [2024-11-16 08:13:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 08:13:26,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:26,249 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] [2024-11-16 08:13:26,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:13:26,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:26,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2058929598, now seen corresponding path program 1 times [2024-11-16 08:13:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:26,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331678607] [2024-11-16 08:13:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331678607] [2024-11-16 08:13:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331678607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012475564] [2024-11-16 08:13:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:26,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:26,536 INFO L87 Difference]: Start difference. First operand 305 states and 490 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:26,587 INFO L93 Difference]: Finished difference Result 472 states and 777 transitions. [2024-11-16 08:13:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-16 08:13:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:26,590 INFO L225 Difference]: With dead ends: 472 [2024-11-16 08:13:26,590 INFO L226 Difference]: Without dead ends: 383 [2024-11-16 08:13:26,594 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-11-16 08:13:26,595 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 124 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:26,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 931 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-16 08:13:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2024-11-16 08:13:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6253298153034301) internal successors, (616), 379 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 616 transitions. [2024-11-16 08:13:26,617 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 616 transitions. Word has length 120 [2024-11-16 08:13:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:26,618 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 616 transitions. [2024-11-16 08:13:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 616 transitions. [2024-11-16 08:13:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 08:13:26,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:26,622 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] [2024-11-16 08:13:26,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:13:26,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1241510925, now seen corresponding path program 1 times [2024-11-16 08:13:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567354105] [2024-11-16 08:13:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:26,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567354105] [2024-11-16 08:13:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567354105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831513119] [2024-11-16 08:13:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:26,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:26,835 INFO L87 Difference]: Start difference. First operand 380 states and 616 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:26,869 INFO L93 Difference]: Finished difference Result 690 states and 1142 transitions. [2024-11-16 08:13:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-16 08:13:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:26,875 INFO L225 Difference]: With dead ends: 690 [2024-11-16 08:13:26,876 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 08:13:26,877 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-11-16 08:13:26,878 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 125 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:26,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 936 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 08:13:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2024-11-16 08:13:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.6436781609195403) internal successors, (858), 522 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 858 transitions. [2024-11-16 08:13:26,895 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 858 transitions. Word has length 123 [2024-11-16 08:13:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:26,895 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 858 transitions. [2024-11-16 08:13:26,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 858 transitions. [2024-11-16 08:13:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 08:13:26,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:26,899 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] [2024-11-16 08:13:26,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:13:26,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:26,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1133263310, now seen corresponding path program 1 times [2024-11-16 08:13:26,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:26,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965309846] [2024-11-16 08:13:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965309846] [2024-11-16 08:13:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965309846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220692203] [2024-11-16 08:13:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:27,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:27,093 INFO L87 Difference]: Start difference. First operand 523 states and 858 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:27,200 INFO L93 Difference]: Finished difference Result 1101 states and 1834 transitions. [2024-11-16 08:13:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:27,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-16 08:13:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:27,205 INFO L225 Difference]: With dead ends: 1101 [2024-11-16 08:13:27,205 INFO L226 Difference]: Without dead ends: 794 [2024-11-16 08:13:27,206 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-11-16 08:13:27,207 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 118 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:27,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 937 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-16 08:13:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 791. [2024-11-16 08:13:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.6531645569620252) internal successors, (1306), 790 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1306 transitions. [2024-11-16 08:13:27,232 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1306 transitions. Word has length 126 [2024-11-16 08:13:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1306 transitions. [2024-11-16 08:13:27,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1306 transitions. [2024-11-16 08:13:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 08:13:27,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:27,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 08:13:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:13:27,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -993650369, now seen corresponding path program 1 times [2024-11-16 08:13:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719045118] [2024-11-16 08:13:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:27,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719045118] [2024-11-16 08:13:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719045118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:27,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:27,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:27,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785968241] [2024-11-16 08:13:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:27,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:27,438 INFO L87 Difference]: Start difference. First operand 791 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:27,478 INFO L93 Difference]: Finished difference Result 1869 states and 3110 transitions. [2024-11-16 08:13:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-16 08:13:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:27,488 INFO L225 Difference]: With dead ends: 1869 [2024-11-16 08:13:27,488 INFO L226 Difference]: Without dead ends: 1294 [2024-11-16 08:13:27,490 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-11-16 08:13:27,491 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 111 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:27,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 978 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-16 08:13:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1291. [2024-11-16 08:13:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.6511627906976745) internal successors, (2130), 1290 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2130 transitions. [2024-11-16 08:13:27,526 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2130 transitions. Word has length 129 [2024-11-16 08:13:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:27,527 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2130 transitions. [2024-11-16 08:13:27,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2130 transitions. [2024-11-16 08:13:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 08:13:27,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:27,529 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] [2024-11-16 08:13:27,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:13:27,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2049956258, now seen corresponding path program 1 times [2024-11-16 08:13:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:27,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453947849] [2024-11-16 08:13:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453947849] [2024-11-16 08:13:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453947849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122280303] [2024-11-16 08:13:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:27,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:27,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:27,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:27,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:27,703 INFO L87 Difference]: Start difference. First operand 1291 states and 2130 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:27,753 INFO L93 Difference]: Finished difference Result 2458 states and 4083 transitions. [2024-11-16 08:13:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:27,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-16 08:13:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:27,763 INFO L225 Difference]: With dead ends: 2458 [2024-11-16 08:13:27,763 INFO L226 Difference]: Without dead ends: 1883 [2024-11-16 08:13:27,765 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-11-16 08:13:27,768 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 112 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:27,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1000 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2024-11-16 08:13:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2024-11-16 08:13:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1879 states have (on average 1.647152740819585) internal successors, (3095), 1879 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 3095 transitions. [2024-11-16 08:13:27,851 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 3095 transitions. Word has length 132 [2024-11-16 08:13:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:27,851 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 3095 transitions. [2024-11-16 08:13:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 3095 transitions. [2024-11-16 08:13:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 08:13:27,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:27,854 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] [2024-11-16 08:13:27,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:13:27,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:27,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -409776806, now seen corresponding path program 1 times [2024-11-16 08:13:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967967599] [2024-11-16 08:13:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967967599] [2024-11-16 08:13:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967967599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:13:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933798086] [2024-11-16 08:13:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:28,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:13:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:13:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:13:28,136 INFO L87 Difference]: Start difference. First operand 1880 states and 3095 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:28,483 INFO L93 Difference]: Finished difference Result 9383 states and 15762 transitions. [2024-11-16 08:13:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:13:28,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-16 08:13:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:28,516 INFO L225 Difference]: With dead ends: 9383 [2024-11-16 08:13:28,516 INFO L226 Difference]: Without dead ends: 7848 [2024-11-16 08:13:28,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:13:28,524 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 1256 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:28,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 3538 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:13:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2024-11-16 08:13:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 3368. [2024-11-16 08:13:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.654885654885655) internal successors, (5572), 3367 states have internal predecessors, (5572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5572 transitions. [2024-11-16 08:13:28,690 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5572 transitions. Word has length 132 [2024-11-16 08:13:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5572 transitions. [2024-11-16 08:13:28,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5572 transitions. [2024-11-16 08:13:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:28,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:28,694 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] [2024-11-16 08:13:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:13:28,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1901477584, now seen corresponding path program 1 times [2024-11-16 08:13:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832447359] [2024-11-16 08:13:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:28,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832447359] [2024-11-16 08:13:28,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832447359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:28,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369999081] [2024-11-16 08:13:28,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:28,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:28,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:28,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:28,874 INFO L87 Difference]: Start difference. First operand 3368 states and 5572 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:29,005 INFO L93 Difference]: Finished difference Result 9631 states and 16103 transitions. [2024-11-16 08:13:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:29,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-16 08:13:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:29,030 INFO L225 Difference]: With dead ends: 9631 [2024-11-16 08:13:29,031 INFO L226 Difference]: Without dead ends: 6689 [2024-11-16 08:13:29,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-16 08:13:29,037 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 437 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:29,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1566 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2024-11-16 08:13:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 5031. [2024-11-16 08:13:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5031 states, 5030 states have (on average 1.658648111332008) internal successors, (8343), 5030 states have internal predecessors, (8343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 8343 transitions. [2024-11-16 08:13:29,192 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 8343 transitions. Word has length 133 [2024-11-16 08:13:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:29,192 INFO L471 AbstractCegarLoop]: Abstraction has 5031 states and 8343 transitions. [2024-11-16 08:13:29,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 8343 transitions. [2024-11-16 08:13:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:29,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:29,195 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] [2024-11-16 08:13:29,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:13:29,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:29,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1982459455, now seen corresponding path program 1 times [2024-11-16 08:13:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884032310] [2024-11-16 08:13:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:29,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884032310] [2024-11-16 08:13:29,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884032310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:29,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:29,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769802956] [2024-11-16 08:13:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:29,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:29,311 INFO L87 Difference]: Start difference. First operand 5031 states and 8343 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:29,398 INFO L93 Difference]: Finished difference Result 9477 states and 15751 transitions. [2024-11-16 08:13:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-16 08:13:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:29,424 INFO L225 Difference]: With dead ends: 9477 [2024-11-16 08:13:29,424 INFO L226 Difference]: Without dead ends: 6886 [2024-11-16 08:13:29,430 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-11-16 08:13:29,431 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 119 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:29,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1027 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2024-11-16 08:13:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6883. [2024-11-16 08:13:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6883 states, 6882 states have (on average 1.647050276082534) internal successors, (11335), 6882 states have internal predecessors, (11335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6883 states to 6883 states and 11335 transitions. [2024-11-16 08:13:29,678 INFO L78 Accepts]: Start accepts. Automaton has 6883 states and 11335 transitions. Word has length 133 [2024-11-16 08:13:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 6883 states and 11335 transitions. [2024-11-16 08:13:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 11335 transitions. [2024-11-16 08:13:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:29,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:29,681 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] [2024-11-16 08:13:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:13:29,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -312634389, now seen corresponding path program 1 times [2024-11-16 08:13:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457754426] [2024-11-16 08:13:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457754426] [2024-11-16 08:13:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457754426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:29,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285960559] [2024-11-16 08:13:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:29,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:29,801 INFO L87 Difference]: Start difference. First operand 6883 states and 11335 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:29,956 INFO L93 Difference]: Finished difference Result 13207 states and 21797 transitions. [2024-11-16 08:13:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-16 08:13:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:29,978 INFO L225 Difference]: With dead ends: 13207 [2024-11-16 08:13:29,979 INFO L226 Difference]: Without dead ends: 9575 [2024-11-16 08:13:29,987 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-11-16 08:13:29,988 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 126 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:29,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1054 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9575 states. [2024-11-16 08:13:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9575 to 9572. [2024-11-16 08:13:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9572 states, 9571 states have (on average 1.6364016299237278) internal successors, (15662), 9571 states have internal predecessors, (15662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9572 states to 9572 states and 15662 transitions. [2024-11-16 08:13:30,290 INFO L78 Accepts]: Start accepts. Automaton has 9572 states and 15662 transitions. Word has length 133 [2024-11-16 08:13:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:30,290 INFO L471 AbstractCegarLoop]: Abstraction has 9572 states and 15662 transitions. [2024-11-16 08:13:30,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 9572 states and 15662 transitions. [2024-11-16 08:13:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:30,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:30,293 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] [2024-11-16 08:13:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:13:30,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1946186943, now seen corresponding path program 1 times [2024-11-16 08:13:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122653156] [2024-11-16 08:13:30,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:30,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122653156] [2024-11-16 08:13:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122653156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897826989] [2024-11-16 08:13:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:30,462 INFO L87 Difference]: Start difference. First operand 9572 states and 15662 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:30,677 INFO L93 Difference]: Finished difference Result 21517 states and 35372 transitions. [2024-11-16 08:13:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-16 08:13:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:30,710 INFO L225 Difference]: With dead ends: 21517 [2024-11-16 08:13:30,710 INFO L226 Difference]: Without dead ends: 14763 [2024-11-16 08:13:30,726 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-11-16 08:13:30,727 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 133 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:30,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1072 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14763 states. [2024-11-16 08:13:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14763 to 14760. [2024-11-16 08:13:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14760 states, 14759 states have (on average 1.6250423470424826) internal successors, (23984), 14759 states have internal predecessors, (23984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14760 states to 14760 states and 23984 transitions. [2024-11-16 08:13:31,113 INFO L78 Accepts]: Start accepts. Automaton has 14760 states and 23984 transitions. Word has length 133 [2024-11-16 08:13:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:31,113 INFO L471 AbstractCegarLoop]: Abstraction has 14760 states and 23984 transitions. [2024-11-16 08:13:31,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 14760 states and 23984 transitions. [2024-11-16 08:13:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 08:13:31,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:31,115 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] [2024-11-16 08:13:31,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:13:31,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 478661340, now seen corresponding path program 1 times [2024-11-16 08:13:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878201203] [2024-11-16 08:13:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878201203] [2024-11-16 08:13:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878201203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:31,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54291245] [2024-11-16 08:13:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:31,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:31,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:31,303 INFO L87 Difference]: Start difference. First operand 14760 states and 23984 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:31,785 INFO L93 Difference]: Finished difference Result 48474 states and 78965 transitions. [2024-11-16 08:13:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-16 08:13:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:31,866 INFO L225 Difference]: With dead ends: 48474 [2024-11-16 08:13:31,866 INFO L226 Difference]: Without dead ends: 33954 [2024-11-16 08:13:31,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-16 08:13:31,898 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 435 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:31,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1545 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2024-11-16 08:13:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 24267. [2024-11-16 08:13:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24267 states, 24266 states have (on average 1.6166652930025551) internal successors, (39230), 24266 states have internal predecessors, (39230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24267 states to 24267 states and 39230 transitions. [2024-11-16 08:13:32,748 INFO L78 Accepts]: Start accepts. Automaton has 24267 states and 39230 transitions. Word has length 134 [2024-11-16 08:13:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:32,749 INFO L471 AbstractCegarLoop]: Abstraction has 24267 states and 39230 transitions. [2024-11-16 08:13:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 24267 states and 39230 transitions. [2024-11-16 08:13:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 08:13:32,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:32,751 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] [2024-11-16 08:13:32,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 08:13:32,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:32,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -736227566, now seen corresponding path program 1 times [2024-11-16 08:13:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374543522] [2024-11-16 08:13:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:32,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374543522] [2024-11-16 08:13:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374543522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668116483] [2024-11-16 08:13:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:32,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:32,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:32,968 INFO L87 Difference]: Start difference. First operand 24267 states and 39230 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:33,827 INFO L93 Difference]: Finished difference Result 79484 states and 128789 transitions. [2024-11-16 08:13:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:33,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-11-16 08:13:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:33,976 INFO L225 Difference]: With dead ends: 79484 [2024-11-16 08:13:33,977 INFO L226 Difference]: Without dead ends: 55457 [2024-11-16 08:13:34,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-16 08:13:34,015 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 433 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:34,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1547 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55457 states. [2024-11-16 08:13:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55457 to 39718. [2024-11-16 08:13:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39718 states, 39717 states have (on average 1.6081778583478108) internal successors, (63872), 39717 states have internal predecessors, (63872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39718 states to 39718 states and 63872 transitions. [2024-11-16 08:13:35,119 INFO L78 Accepts]: Start accepts. Automaton has 39718 states and 63872 transitions. Word has length 135 [2024-11-16 08:13:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:35,120 INFO L471 AbstractCegarLoop]: Abstraction has 39718 states and 63872 transitions. [2024-11-16 08:13:35,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 39718 states and 63872 transitions. [2024-11-16 08:13:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 08:13:35,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:35,122 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] [2024-11-16 08:13:35,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 08:13:35,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:35,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash 199663710, now seen corresponding path program 1 times [2024-11-16 08:13:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722869471] [2024-11-16 08:13:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722869471] [2024-11-16 08:13:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722869471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935971164] [2024-11-16 08:13:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:35,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:35,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:35,512 INFO L87 Difference]: Start difference. First operand 39718 states and 63872 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:36,804 INFO L93 Difference]: Finished difference Result 128686 states and 207397 transitions. [2024-11-16 08:13:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-16 08:13:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:37,089 INFO L225 Difference]: With dead ends: 128686 [2024-11-16 08:13:37,090 INFO L226 Difference]: Without dead ends: 89208 [2024-11-16 08:13:37,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-16 08:13:37,154 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 431 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:37,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1550 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89208 states. [2024-11-16 08:13:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89208 to 64237. [2024-11-16 08:13:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64237 states, 64236 states have (on average 1.5998194159038546) internal successors, (102766), 64236 states have internal predecessors, (102766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64237 states to 64237 states and 102766 transitions. [2024-11-16 08:13:38,912 INFO L78 Accepts]: Start accepts. Automaton has 64237 states and 102766 transitions. Word has length 136 [2024-11-16 08:13:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:38,913 INFO L471 AbstractCegarLoop]: Abstraction has 64237 states and 102766 transitions. [2024-11-16 08:13:38,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 64237 states and 102766 transitions. [2024-11-16 08:13:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:13:38,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:38,914 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] [2024-11-16 08:13:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 08:13:38,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:38,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash -998650400, now seen corresponding path program 1 times [2024-11-16 08:13:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960625296] [2024-11-16 08:13:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960625296] [2024-11-16 08:13:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960625296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:39,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:13:39,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557915392] [2024-11-16 08:13:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:39,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:13:39,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:13:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:13:39,745 INFO L87 Difference]: Start difference. First operand 64237 states and 102766 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:40,991 INFO L93 Difference]: Finished difference Result 128237 states and 205165 transitions. [2024-11-16 08:13:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:13:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-16 08:13:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:41,131 INFO L225 Difference]: With dead ends: 128237 [2024-11-16 08:13:41,131 INFO L226 Difference]: Without dead ends: 64240 [2024-11-16 08:13:41,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:13:41,188 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 225 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:41,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1846 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64240 states. [2024-11-16 08:13:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64240 to 64237. [2024-11-16 08:13:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64237 states, 64236 states have (on average 1.590089669344293) internal successors, (102141), 64236 states have internal predecessors, (102141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64237 states to 64237 states and 102141 transitions. [2024-11-16 08:13:42,731 INFO L78 Accepts]: Start accepts. Automaton has 64237 states and 102141 transitions. Word has length 138 [2024-11-16 08:13:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:42,732 INFO L471 AbstractCegarLoop]: Abstraction has 64237 states and 102141 transitions. [2024-11-16 08:13:42,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 64237 states and 102141 transitions. [2024-11-16 08:13:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 08:13:42,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:42,735 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] [2024-11-16 08:13:42,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 08:13:42,735 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:42,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash 557757243, now seen corresponding path program 1 times [2024-11-16 08:13:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568211556] [2024-11-16 08:13:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:42,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:43,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:43,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568211556] [2024-11-16 08:13:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568211556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:43,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:43,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:13:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553577049] [2024-11-16 08:13:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:43,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:13:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:13:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:13:43,141 INFO L87 Difference]: Start difference. First operand 64237 states and 102141 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:45,078 INFO L93 Difference]: Finished difference Result 187715 states and 299009 transitions. [2024-11-16 08:13:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:13:45,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2024-11-16 08:13:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:45,301 INFO L225 Difference]: With dead ends: 187715 [2024-11-16 08:13:45,301 INFO L226 Difference]: Without dead ends: 123718 [2024-11-16 08:13:45,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:13:45,387 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 324 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:45,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1857 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123718 states. [2024-11-16 08:13:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123718 to 123715. [2024-11-16 08:13:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123715 states, 123714 states have (on average 1.5779782401345037) internal successors, (195218), 123714 states have internal predecessors, (195218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123715 states to 123715 states and 195218 transitions. [2024-11-16 08:13:47,588 INFO L78 Accepts]: Start accepts. Automaton has 123715 states and 195218 transitions. Word has length 143 [2024-11-16 08:13:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:47,588 INFO L471 AbstractCegarLoop]: Abstraction has 123715 states and 195218 transitions. [2024-11-16 08:13:47,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 123715 states and 195218 transitions. [2024-11-16 08:13:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 08:13:47,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:47,590 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] [2024-11-16 08:13:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 08:13:47,590 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -437735778, now seen corresponding path program 1 times [2024-11-16 08:13:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155066939] [2024-11-16 08:13:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155066939] [2024-11-16 08:13:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155066939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:13:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438369466] [2024-11-16 08:13:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:48,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:13:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:13:48,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:13:48,699 INFO L87 Difference]: Start difference. First operand 123715 states and 195218 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:50,060 INFO L93 Difference]: Finished difference Result 129526 states and 202964 transitions. [2024-11-16 08:13:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 08:13:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-11-16 08:13:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:50,270 INFO L225 Difference]: With dead ends: 129526 [2024-11-16 08:13:50,270 INFO L226 Difference]: Without dead ends: 129523 [2024-11-16 08:13:50,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:13:50,302 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:50,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3369 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:13:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129523 states. [2024-11-16 08:13:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129523 to 129523. [2024-11-16 08:13:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129523 states, 129522 states have (on average 1.5518521949939006) internal successors, (200999), 129522 states have internal predecessors, (200999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129523 states to 129523 states and 200999 transitions. [2024-11-16 08:13:52,532 INFO L78 Accepts]: Start accepts. Automaton has 129523 states and 200999 transitions. Word has length 145 [2024-11-16 08:13:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:52,533 INFO L471 AbstractCegarLoop]: Abstraction has 129523 states and 200999 transitions. [2024-11-16 08:13:52,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 129523 states and 200999 transitions. [2024-11-16 08:13:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 08:13:52,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:52,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 08:13:52,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 08:13:52,541 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:52,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -18385151, now seen corresponding path program 1 times [2024-11-16 08:13:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469619145] [2024-11-16 08:13:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 08:13:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469619145] [2024-11-16 08:13:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469619145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875181830] [2024-11-16 08:13:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:52,707 INFO L87 Difference]: Start difference. First operand 129523 states and 200999 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:13:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:55,873 INFO L93 Difference]: Finished difference Result 387546 states and 600982 transitions. [2024-11-16 08:13:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 181 [2024-11-16 08:13:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:56,344 INFO L225 Difference]: With dead ends: 387546 [2024-11-16 08:13:56,344 INFO L226 Difference]: Without dead ends: 258084 [2024-11-16 08:13:56,410 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-11-16 08:13:56,413 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 360 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:56,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1243 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:13:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258084 states. [2024-11-16 08:14:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258084 to 258081. [2024-11-16 08:14:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258081 states, 258080 states have (on average 1.541475511469312) internal successors, (397824), 258080 states have internal predecessors, (397824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:14:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258081 states to 258081 states and 397824 transitions. [2024-11-16 08:14:01,707 INFO L78 Accepts]: Start accepts. Automaton has 258081 states and 397824 transitions. Word has length 181 [2024-11-16 08:14:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:14:01,708 INFO L471 AbstractCegarLoop]: Abstraction has 258081 states and 397824 transitions. [2024-11-16 08:14:01,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:14:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 258081 states and 397824 transitions. [2024-11-16 08:14:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 08:14:01,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:14:01,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 08:14:01,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 08:14:01,722 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:14:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:14:01,723 INFO L85 PathProgramCache]: Analyzing trace with hash 844077781, now seen corresponding path program 1 times [2024-11-16 08:14:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:14:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317224781] [2024-11-16 08:14:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:14:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:14:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:14:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 08:14:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:14:01,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317224781] [2024-11-16 08:14:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317224781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:14:01,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:14:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:14:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291350592] [2024-11-16 08:14:01,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:14:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:14:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:14:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:14:01,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:14:01,862 INFO L87 Difference]: Start difference. First operand 258081 states and 397824 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:14:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:14:07,538 INFO L93 Difference]: Finished difference Result 772248 states and 1189529 transitions. [2024-11-16 08:14:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:14:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 181 [2024-11-16 08:14:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:14:08,657 INFO L225 Difference]: With dead ends: 772248 [2024-11-16 08:14:08,657 INFO L226 Difference]: Without dead ends: 514288 [2024-11-16 08:14:08,846 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-11-16 08:14:08,848 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 372 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:14:08,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1254 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:14:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514288 states.