./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.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.2.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 86aaf7922fe6f7f87277fe3baca1629811408ccdafec5bb956830ba2f5ff28a9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:13:07,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:13:07,712 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:07,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:13:07,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:13:07,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:13:07,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:13:07,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:13:07,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:13:07,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:13:07,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:13:07,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:13:07,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:13:07,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:13:07,759 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:13:07,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:13:07,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:13:07,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:13:07,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:13:07,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:13:07,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:13:07,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:13:07,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:13:07,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:13:07,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:13:07,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:13:07,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:13:07,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:13:07,764 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:13:07,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:13:07,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:13:07,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:13:07,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:13:07,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:13:07,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:13:07,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:13:07,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:13:07,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:13:07,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:13:07,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:13:07,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:13:07,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:13:07,773 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 -> 86aaf7922fe6f7f87277fe3baca1629811408ccdafec5bb956830ba2f5ff28a9 [2024-11-16 08:13:08,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:13:08,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:13:08,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:13:08,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:13:08,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:13:08,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2024-11-16 08:13:09,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:13:09,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:13:09,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2024-11-16 08:13:09,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12050060f/490ffb6c022b4d36adc710205bb81ff8/FLAG3d6a1e419 [2024-11-16 08:13:09,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12050060f/490ffb6c022b4d36adc710205bb81ff8 [2024-11-16 08:13:09,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:13:09,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:13:09,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:13:09,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:13:09,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:13:09,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:13:09" (1/1) ... [2024-11-16 08:13:09,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98c1def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:09, skipping insertion in model container [2024-11-16 08:13:09,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:13:09" (1/1) ... [2024-11-16 08:13:09,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:13:10,208 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.2.ufo.BOUNDED-8.pals.c[28194,28207] [2024-11-16 08:13:10,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:13:10,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:13:10,302 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.2.ufo.BOUNDED-8.pals.c[28194,28207] [2024-11-16 08:13:10,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:13:10,327 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:13:10,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:10 WrapperNode [2024-11-16 08:13:10,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:13:10,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:13:10,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:13:10,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:13:10,337 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:10" (1/1) ... [2024-11-16 08:13:10,356 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:10" (1/1) ... [2024-11-16 08:13:10,402 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 957 [2024-11-16 08:13:10,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:13:10,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:13:10,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:13:10,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:13:10,429 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:10" (1/1) ... [2024-11-16 08:13:10,429 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:10" (1/1) ... [2024-11-16 08:13:10,435 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:10" (1/1) ... [2024-11-16 08:13:10,459 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:10,459 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:10" (1/1) ... [2024-11-16 08:13:10,459 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:10" (1/1) ... [2024-11-16 08:13:10,476 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:10" (1/1) ... [2024-11-16 08:13:10,478 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:10" (1/1) ... [2024-11-16 08:13:10,481 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:10" (1/1) ... [2024-11-16 08:13:10,484 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:10" (1/1) ... [2024-11-16 08:13:10,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:13:10,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:13:10,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:13:10,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:13:10,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:10" (1/1) ... [2024-11-16 08:13:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:13:10,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:13:10,556 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:10,563 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:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:13:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:13:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:13:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:13:10,746 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:13:10,747 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:13:11,751 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-16 08:13:11,753 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:13:11,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:13:11,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:13:11,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:13:11 BoogieIcfgContainer [2024-11-16 08:13:11,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:13:11,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:13:11,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:13:11,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:13:11,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:13:09" (1/3) ... [2024-11-16 08:13:11,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d91c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:13:11, skipping insertion in model container [2024-11-16 08:13:11,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:10" (2/3) ... [2024-11-16 08:13:11,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d91c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:13:11, skipping insertion in model container [2024-11-16 08:13:11,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:13:11" (3/3) ... [2024-11-16 08:13:11,793 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2024-11-16 08:13:11,811 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:13:11,811 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:13:11,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:13:11,903 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;@1c9fad02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:13:11,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:13:11,912 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:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 08:13:11,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:11,930 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:11,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1106129407, now seen corresponding path program 1 times [2024-11-16 08:13:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697541724] [2024-11-16 08:13:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:12,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:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:12,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697541724] [2024-11-16 08:13:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697541724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 08:13:12,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586637466] [2024-11-16 08:13:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:12,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 08:13:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 08:13:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:13:12,475 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:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:12,527 INFO L93 Difference]: Finished difference Result 404 states and 701 transitions. [2024-11-16 08:13:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 08:13:12,532 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:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:12,547 INFO L225 Difference]: With dead ends: 404 [2024-11-16 08:13:12,548 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 08:13:12,551 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:12,554 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:12,555 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:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 08:13:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-16 08:13:12,608 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:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 532 transitions. [2024-11-16 08:13:12,612 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 532 transitions. Word has length 79 [2024-11-16 08:13:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:12,613 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 532 transitions. [2024-11-16 08:13:12,613 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:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 532 transitions. [2024-11-16 08:13:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 08:13:12,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:12,617 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:12,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:13:12,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:12,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1075109600, now seen corresponding path program 1 times [2024-11-16 08:13:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977841365] [2024-11-16 08:13:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:13,103 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:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977841365] [2024-11-16 08:13:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977841365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:13,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:13:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199681957] [2024-11-16 08:13:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:13:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:13:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:13:13,112 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:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:13,224 INFO L93 Difference]: Finished difference Result 398 states and 690 transitions. [2024-11-16 08:13:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:13:13,225 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:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:13,229 INFO L225 Difference]: With dead ends: 398 [2024-11-16 08:13:13,229 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 08:13:13,230 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:13,231 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:13,232 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:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 08:13:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-16 08:13:13,247 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:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 490 transitions. [2024-11-16 08:13:13,248 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 490 transitions. Word has length 79 [2024-11-16 08:13:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:13,248 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 490 transitions. [2024-11-16 08:13:13,249 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:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 490 transitions. [2024-11-16 08:13:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 08:13:13,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:13,254 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:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:13:13,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:13,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2058929598, now seen corresponding path program 1 times [2024-11-16 08:13:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:13,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925165015] [2024-11-16 08:13:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:13,520 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:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925165015] [2024-11-16 08:13:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925165015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122172414] [2024-11-16 08:13:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:13,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:13,527 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:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:13,578 INFO L93 Difference]: Finished difference Result 472 states and 777 transitions. [2024-11-16 08:13:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:13,578 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:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:13,582 INFO L225 Difference]: With dead ends: 472 [2024-11-16 08:13:13,583 INFO L226 Difference]: Without dead ends: 383 [2024-11-16 08:13:13,584 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:13,585 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:13,587 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:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-16 08:13:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2024-11-16 08:13:13,603 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:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 616 transitions. [2024-11-16 08:13:13,605 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 616 transitions. Word has length 120 [2024-11-16 08:13:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:13,606 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 616 transitions. [2024-11-16 08:13:13,606 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:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 616 transitions. [2024-11-16 08:13:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 08:13:13,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:13,608 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:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:13:13,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1241510925, now seen corresponding path program 1 times [2024-11-16 08:13:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128694965] [2024-11-16 08:13:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:13,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:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128694965] [2024-11-16 08:13:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128694965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:13,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:13,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865168127] [2024-11-16 08:13:13,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:13,802 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:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:13,835 INFO L93 Difference]: Finished difference Result 690 states and 1142 transitions. [2024-11-16 08:13:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:13,836 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:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:13,840 INFO L225 Difference]: With dead ends: 690 [2024-11-16 08:13:13,840 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 08:13:13,843 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:13,846 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:13,846 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:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 08:13:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2024-11-16 08:13:13,865 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:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 858 transitions. [2024-11-16 08:13:13,866 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 858 transitions. Word has length 123 [2024-11-16 08:13:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:13,868 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 858 transitions. [2024-11-16 08:13:13,868 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:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 858 transitions. [2024-11-16 08:13:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 08:13:13,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:13,872 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:13,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:13:13,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:13,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1133263310, now seen corresponding path program 1 times [2024-11-16 08:13:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578660354] [2024-11-16 08:13:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:14,063 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:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578660354] [2024-11-16 08:13:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578660354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502913876] [2024-11-16 08:13:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:14,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:14,068 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:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:14,153 INFO L93 Difference]: Finished difference Result 1101 states and 1834 transitions. [2024-11-16 08:13:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:14,154 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:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:14,157 INFO L225 Difference]: With dead ends: 1101 [2024-11-16 08:13:14,157 INFO L226 Difference]: Without dead ends: 794 [2024-11-16 08:13:14,158 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:14,159 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:14,159 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:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-16 08:13:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 791. [2024-11-16 08:13:14,176 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:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1306 transitions. [2024-11-16 08:13:14,179 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1306 transitions. Word has length 126 [2024-11-16 08:13:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:14,180 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1306 transitions. [2024-11-16 08:13:14,180 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:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1306 transitions. [2024-11-16 08:13:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 08:13:14,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:14,182 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:14,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:13:14,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -993650369, now seen corresponding path program 1 times [2024-11-16 08:13:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:14,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477368429] [2024-11-16 08:13:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:14,367 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:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477368429] [2024-11-16 08:13:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477368429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136016393] [2024-11-16 08:13:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:14,370 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:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:14,408 INFO L93 Difference]: Finished difference Result 1869 states and 3110 transitions. [2024-11-16 08:13:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:14,409 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:14,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:14,417 INFO L225 Difference]: With dead ends: 1869 [2024-11-16 08:13:14,417 INFO L226 Difference]: Without dead ends: 1294 [2024-11-16 08:13:14,419 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:14,420 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:14,421 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:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-16 08:13:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1291. [2024-11-16 08:13:14,451 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:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2130 transitions. [2024-11-16 08:13:14,458 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2130 transitions. Word has length 129 [2024-11-16 08:13:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:14,459 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2130 transitions. [2024-11-16 08:13:14,459 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:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2130 transitions. [2024-11-16 08:13:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 08:13:14,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:14,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:13:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:13:14,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2049956258, now seen corresponding path program 1 times [2024-11-16 08:13:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170090416] [2024-11-16 08:13:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170090416] [2024-11-16 08:13:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170090416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944287153] [2024-11-16 08:13:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:14,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:14,648 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:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:14,692 INFO L93 Difference]: Finished difference Result 2458 states and 4083 transitions. [2024-11-16 08:13:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:14,693 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:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:14,701 INFO L225 Difference]: With dead ends: 2458 [2024-11-16 08:13:14,701 INFO L226 Difference]: Without dead ends: 1883 [2024-11-16 08:13:14,703 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:14,705 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:14,706 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:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2024-11-16 08:13:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2024-11-16 08:13:14,744 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:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 3095 transitions. [2024-11-16 08:13:14,751 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 3095 transitions. Word has length 132 [2024-11-16 08:13:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:14,751 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 3095 transitions. [2024-11-16 08:13:14,752 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:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 3095 transitions. [2024-11-16 08:13:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 08:13:14,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:14,754 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:14,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:13:14,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:14,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash -409776806, now seen corresponding path program 1 times [2024-11-16 08:13:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:14,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370250527] [2024-11-16 08:13:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:15,046 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:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370250527] [2024-11-16 08:13:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370250527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:15,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:13:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172285248] [2024-11-16 08:13:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:13:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:15,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:13:15,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:13:15,052 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:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:15,398 INFO L93 Difference]: Finished difference Result 9383 states and 15762 transitions. [2024-11-16 08:13:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:13:15,399 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:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:15,427 INFO L225 Difference]: With dead ends: 9383 [2024-11-16 08:13:15,428 INFO L226 Difference]: Without dead ends: 7848 [2024-11-16 08:13:15,434 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:15,437 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:15,437 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:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2024-11-16 08:13:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 3368. [2024-11-16 08:13:15,564 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:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5572 transitions. [2024-11-16 08:13:15,576 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5572 transitions. Word has length 132 [2024-11-16 08:13:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:15,577 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5572 transitions. [2024-11-16 08:13:15,577 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:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5572 transitions. [2024-11-16 08:13:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:15,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:15,580 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:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:13:15,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1901477584, now seen corresponding path program 1 times [2024-11-16 08:13:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719428811] [2024-11-16 08:13:15,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:15,798 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:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719428811] [2024-11-16 08:13:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719428811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:15,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:15,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708284899] [2024-11-16 08:13:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:15,801 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:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:15,936 INFO L93 Difference]: Finished difference Result 9631 states and 16103 transitions. [2024-11-16 08:13:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:15,937 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:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:15,962 INFO L225 Difference]: With dead ends: 9631 [2024-11-16 08:13:15,962 INFO L226 Difference]: Without dead ends: 6689 [2024-11-16 08:13:15,968 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:15,971 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 437 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:15,971 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:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2024-11-16 08:13:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 5031. [2024-11-16 08:13:16,102 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:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 8343 transitions. [2024-11-16 08:13:16,117 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 8343 transitions. Word has length 133 [2024-11-16 08:13:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:16,118 INFO L471 AbstractCegarLoop]: Abstraction has 5031 states and 8343 transitions. [2024-11-16 08:13:16,118 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:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 8343 transitions. [2024-11-16 08:13:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:16,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:16,121 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:16,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:13:16,121 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1982459455, now seen corresponding path program 1 times [2024-11-16 08:13:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680021519] [2024-11-16 08:13:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:16,290 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:16,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:16,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680021519] [2024-11-16 08:13:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680021519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127768438] [2024-11-16 08:13:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:16,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:16,292 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:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:16,383 INFO L93 Difference]: Finished difference Result 9477 states and 15751 transitions. [2024-11-16 08:13:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:16,384 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:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:16,418 INFO L225 Difference]: With dead ends: 9477 [2024-11-16 08:13:16,422 INFO L226 Difference]: Without dead ends: 6886 [2024-11-16 08:13:16,428 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:16,429 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:16,429 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:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2024-11-16 08:13:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6883. [2024-11-16 08:13:16,563 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:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6883 states to 6883 states and 11335 transitions. [2024-11-16 08:13:16,582 INFO L78 Accepts]: Start accepts. Automaton has 6883 states and 11335 transitions. Word has length 133 [2024-11-16 08:13:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:16,582 INFO L471 AbstractCegarLoop]: Abstraction has 6883 states and 11335 transitions. [2024-11-16 08:13:16,583 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:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 11335 transitions. [2024-11-16 08:13:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:16,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:16,585 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:16,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:13:16,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:16,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash -312634389, now seen corresponding path program 1 times [2024-11-16 08:13:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:16,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495842321] [2024-11-16 08:13:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:16,702 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:16,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495842321] [2024-11-16 08:13:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495842321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325474564] [2024-11-16 08:13:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:16,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:16,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:16,704 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:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:16,877 INFO L93 Difference]: Finished difference Result 13207 states and 21797 transitions. [2024-11-16 08:13:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:16,878 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:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:16,902 INFO L225 Difference]: With dead ends: 13207 [2024-11-16 08:13:16,903 INFO L226 Difference]: Without dead ends: 9575 [2024-11-16 08:13:16,909 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:16,910 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:16,910 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:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9575 states. [2024-11-16 08:13:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9575 to 9572. [2024-11-16 08:13:17,087 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:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9572 states to 9572 states and 15662 transitions. [2024-11-16 08:13:17,114 INFO L78 Accepts]: Start accepts. Automaton has 9572 states and 15662 transitions. Word has length 133 [2024-11-16 08:13:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:17,114 INFO L471 AbstractCegarLoop]: Abstraction has 9572 states and 15662 transitions. [2024-11-16 08:13:17,114 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:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9572 states and 15662 transitions. [2024-11-16 08:13:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 08:13:17,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:17,116 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:17,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:13:17,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:17,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1946186943, now seen corresponding path program 1 times [2024-11-16 08:13:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:17,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752213763] [2024-11-16 08:13:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:13:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752213763] [2024-11-16 08:13:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752213763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134723518] [2024-11-16 08:13:17,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:17,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:17,226 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:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:17,490 INFO L93 Difference]: Finished difference Result 21517 states and 35372 transitions. [2024-11-16 08:13:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:17,491 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:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:17,524 INFO L225 Difference]: With dead ends: 21517 [2024-11-16 08:13:17,525 INFO L226 Difference]: Without dead ends: 14763 [2024-11-16 08:13:17,538 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:17,539 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:17,539 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:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14763 states. [2024-11-16 08:13:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14763 to 14760. [2024-11-16 08:13:17,865 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:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14760 states to 14760 states and 23984 transitions. [2024-11-16 08:13:17,899 INFO L78 Accepts]: Start accepts. Automaton has 14760 states and 23984 transitions. Word has length 133 [2024-11-16 08:13:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:17,899 INFO L471 AbstractCegarLoop]: Abstraction has 14760 states and 23984 transitions. [2024-11-16 08:13:17,900 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:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 14760 states and 23984 transitions. [2024-11-16 08:13:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 08:13:17,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:17,902 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:17,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:13:17,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash 478661340, now seen corresponding path program 1 times [2024-11-16 08:13:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904830415] [2024-11-16 08:13:17,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:17,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:18,128 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:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904830415] [2024-11-16 08:13:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904830415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288948631] [2024-11-16 08:13:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:18,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:18,131 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:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:18,643 INFO L93 Difference]: Finished difference Result 48474 states and 78965 transitions. [2024-11-16 08:13:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:18,644 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:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:18,717 INFO L225 Difference]: With dead ends: 48474 [2024-11-16 08:13:18,718 INFO L226 Difference]: Without dead ends: 33954 [2024-11-16 08:13:18,748 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:18,749 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:18,749 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:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2024-11-16 08:13:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 24267. [2024-11-16 08:13:19,439 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:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24267 states to 24267 states and 39230 transitions. [2024-11-16 08:13:19,492 INFO L78 Accepts]: Start accepts. Automaton has 24267 states and 39230 transitions. Word has length 134 [2024-11-16 08:13:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:19,492 INFO L471 AbstractCegarLoop]: Abstraction has 24267 states and 39230 transitions. [2024-11-16 08:13:19,493 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:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24267 states and 39230 transitions. [2024-11-16 08:13:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 08:13:19,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:19,494 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:19,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 08:13:19,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:19,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash -736227566, now seen corresponding path program 1 times [2024-11-16 08:13:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238057045] [2024-11-16 08:13:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:19,658 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:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238057045] [2024-11-16 08:13:19,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238057045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:19,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:19,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438931421] [2024-11-16 08:13:19,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:19,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:19,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:19,661 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:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:20,664 INFO L93 Difference]: Finished difference Result 79484 states and 128789 transitions. [2024-11-16 08:13:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:20,667 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:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:20,819 INFO L225 Difference]: With dead ends: 79484 [2024-11-16 08:13:20,819 INFO L226 Difference]: Without dead ends: 55457 [2024-11-16 08:13:20,863 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:20,864 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:20,865 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:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55457 states. [2024-11-16 08:13:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55457 to 39718. [2024-11-16 08:13:21,993 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:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39718 states to 39718 states and 63872 transitions. [2024-11-16 08:13:22,114 INFO L78 Accepts]: Start accepts. Automaton has 39718 states and 63872 transitions. Word has length 135 [2024-11-16 08:13:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:22,115 INFO L471 AbstractCegarLoop]: Abstraction has 39718 states and 63872 transitions. [2024-11-16 08:13:22,115 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:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 39718 states and 63872 transitions. [2024-11-16 08:13:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 08:13:22,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:22,117 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:22,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 08:13:22,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash 199663710, now seen corresponding path program 1 times [2024-11-16 08:13:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273376511] [2024-11-16 08:13:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:22,446 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:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273376511] [2024-11-16 08:13:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273376511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:13:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782734430] [2024-11-16 08:13:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:22,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:13:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:13:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:13:22,449 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:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:23,661 INFO L93 Difference]: Finished difference Result 128686 states and 207397 transitions. [2024-11-16 08:13:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:13:23,662 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:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:23,877 INFO L225 Difference]: With dead ends: 128686 [2024-11-16 08:13:23,877 INFO L226 Difference]: Without dead ends: 89208 [2024-11-16 08:13:23,917 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:23,918 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:23,920 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:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89208 states. [2024-11-16 08:13:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89208 to 64237. [2024-11-16 08:13:25,326 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:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64237 states to 64237 states and 102766 transitions. [2024-11-16 08:13:25,533 INFO L78 Accepts]: Start accepts. Automaton has 64237 states and 102766 transitions. Word has length 136 [2024-11-16 08:13:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 64237 states and 102766 transitions. [2024-11-16 08:13:25,534 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:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 64237 states and 102766 transitions. [2024-11-16 08:13:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:13:25,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:25,536 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:25,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 08:13:25,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:25,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash -998650400, now seen corresponding path program 1 times [2024-11-16 08:13:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:25,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361526520] [2024-11-16 08:13:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:26,201 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,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361526520] [2024-11-16 08:13:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361526520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:13:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424387255] [2024-11-16 08:13:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:26,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:13:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:13:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:13:26,204 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:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:27,520 INFO L93 Difference]: Finished difference Result 128237 states and 205165 transitions. [2024-11-16 08:13:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:13:27,521 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:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:27,646 INFO L225 Difference]: With dead ends: 128237 [2024-11-16 08:13:27,646 INFO L226 Difference]: Without dead ends: 64240 [2024-11-16 08:13:27,697 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:27,700 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:27,700 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:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64240 states. [2024-11-16 08:13:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64240 to 64237. [2024-11-16 08:13:28,981 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:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64237 states to 64237 states and 102141 transitions. [2024-11-16 08:13:29,152 INFO L78 Accepts]: Start accepts. Automaton has 64237 states and 102141 transitions. Word has length 138 [2024-11-16 08:13:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:29,153 INFO L471 AbstractCegarLoop]: Abstraction has 64237 states and 102141 transitions. [2024-11-16 08:13:29,153 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:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 64237 states and 102141 transitions. [2024-11-16 08:13:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 08:13:29,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:29,155 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:29,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 08:13:29,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:29,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash 557757243, now seen corresponding path program 1 times [2024-11-16 08:13:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:29,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299215525] [2024-11-16 08:13:29,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:29,623 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,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:29,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299215525] [2024-11-16 08:13:29,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299215525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:29,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:29,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:13:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850292944] [2024-11-16 08:13:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:13:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:13:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:13:29,627 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:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:31,198 INFO L93 Difference]: Finished difference Result 187715 states and 299009 transitions. [2024-11-16 08:13:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:13:31,199 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:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:31,490 INFO L225 Difference]: With dead ends: 187715 [2024-11-16 08:13:31,491 INFO L226 Difference]: Without dead ends: 123718 [2024-11-16 08:13:31,536 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:31,537 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:31,537 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:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123718 states. [2024-11-16 08:13:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123718 to 123715. [2024-11-16 08:13:33,716 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:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123715 states to 123715 states and 195218 transitions. [2024-11-16 08:13:34,337 INFO L78 Accepts]: Start accepts. Automaton has 123715 states and 195218 transitions. Word has length 143 [2024-11-16 08:13:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:34,338 INFO L471 AbstractCegarLoop]: Abstraction has 123715 states and 195218 transitions. [2024-11-16 08:13:34,338 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:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 123715 states and 195218 transitions. [2024-11-16 08:13:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 08:13:34,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:34,340 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:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 08:13:34,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -437735778, now seen corresponding path program 1 times [2024-11-16 08:13:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144516755] [2024-11-16 08:13:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:34,912 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:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144516755] [2024-11-16 08:13:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144516755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:34,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:13:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426286328] [2024-11-16 08:13:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:34,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:13:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:13:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:13:34,916 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:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:36,224 INFO L93 Difference]: Finished difference Result 129526 states and 202964 transitions. [2024-11-16 08:13:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 08:13:36,224 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:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:36,412 INFO L225 Difference]: With dead ends: 129526 [2024-11-16 08:13:36,412 INFO L226 Difference]: Without dead ends: 129523 [2024-11-16 08:13:36,454 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:36,455 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:36,455 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:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129523 states. [2024-11-16 08:13:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129523 to 129523. [2024-11-16 08:13:39,226 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:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129523 states to 129523 states and 200999 transitions. [2024-11-16 08:13:39,495 INFO L78 Accepts]: Start accepts. Automaton has 129523 states and 200999 transitions. Word has length 145 [2024-11-16 08:13:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:39,495 INFO L471 AbstractCegarLoop]: Abstraction has 129523 states and 200999 transitions. [2024-11-16 08:13:39,496 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:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 129523 states and 200999 transitions. [2024-11-16 08:13:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 08:13:39,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:39,504 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:39,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 08:13:39,504 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -18385151, now seen corresponding path program 1 times [2024-11-16 08:13:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:39,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725879824] [2024-11-16 08:13:39,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:39,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:39,643 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:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725879824] [2024-11-16 08:13:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725879824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686422530] [2024-11-16 08:13:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:39,646 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:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:42,122 INFO L93 Difference]: Finished difference Result 387546 states and 600982 transitions. [2024-11-16 08:13:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:42,122 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:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:42,625 INFO L225 Difference]: With dead ends: 387546 [2024-11-16 08:13:42,625 INFO L226 Difference]: Without dead ends: 258084 [2024-11-16 08:13:43,098 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:43,098 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:43,099 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:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258084 states. [2024-11-16 08:13:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258084 to 258081. [2024-11-16 08:13:47,900 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:13:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258081 states to 258081 states and 397824 transitions. [2024-11-16 08:13:48,565 INFO L78 Accepts]: Start accepts. Automaton has 258081 states and 397824 transitions. Word has length 181 [2024-11-16 08:13:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:13:48,566 INFO L471 AbstractCegarLoop]: Abstraction has 258081 states and 397824 transitions. [2024-11-16 08:13:48,566 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:13:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 258081 states and 397824 transitions. [2024-11-16 08:13:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 08:13:48,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:13:48,579 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:48,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 08:13:48,580 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:13:48,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:13:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash 844077781, now seen corresponding path program 1 times [2024-11-16 08:13:48,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:13:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869823991] [2024-11-16 08:13:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:13:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:13:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:13:48,748 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:13:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:13:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869823991] [2024-11-16 08:13:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869823991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:13:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:13:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:13:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686110916] [2024-11-16 08:13:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:13:48,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:13:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:13:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:13:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:13:48,751 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:13:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:13:54,606 INFO L93 Difference]: Finished difference Result 772248 states and 1189529 transitions. [2024-11-16 08:13:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:13:54,606 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:13:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:13:55,764 INFO L225 Difference]: With dead ends: 772248 [2024-11-16 08:13:55,765 INFO L226 Difference]: Without dead ends: 514288 [2024-11-16 08:13:55,967 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:55,968 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:13:55,969 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.0s Time] [2024-11-16 08:13:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514288 states.