./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.3.1.ufo.UNBOUNDED.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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:31:27,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:31:27,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:31:27,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:31:27,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:31:27,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:31:27,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:31:27,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:31:27,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:31:27,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:31:27,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:31:27,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:31:27,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:31:27,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:31:27,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:31:27,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:31:27,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:31:27,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:31:27,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:31:27,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:31:27,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:31:27,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:31:27,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:31:27,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:31:27,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:31:27,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:31:27,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:31:27,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:31:27,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:31:27,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:31:27,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:31:27,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:31:27,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:31:27,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:31:27,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:31:27,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:31:27,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:31:27,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:31:27,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:31:27,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:31:27,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:31:27,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:31:27,928 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-11-09 23:31:28,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:31:28,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:31:28,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:31:28,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:31:28,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:31:28,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-09 23:31:29,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:31:29,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:31:29,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-09 23:31:29,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237b12fff/c340888635fa432f97742ee1205423b8/FLAGb699055ed [2024-11-09 23:31:29,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237b12fff/c340888635fa432f97742ee1205423b8 [2024-11-09 23:31:29,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:31:29,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:31:29,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:31:29,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:31:29,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:31:29,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:29,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481eafc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29, skipping insertion in model container [2024-11-09 23:31:29,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:29,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:31:29,829 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.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-11-09 23:31:29,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:31:29,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:31:29,899 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.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-11-09 23:31:29,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:31:29,917 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:31:29,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29 WrapperNode [2024-11-09 23:31:29,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:31:29,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:31:29,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:31:29,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:31:29,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:29,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:29,968 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 441 [2024-11-09 23:31:29,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:31:29,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:31:29,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:31:29,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:31:29,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:29,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:29,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,010 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-09 23:31:30,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:31:30,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:31:30,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:31:30,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:31:30,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (1/1) ... [2024-11-09 23:31:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:31:30,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:31:30,059 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-09 23:31:30,061 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-09 23:31:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:31:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:31:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:31:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:31:30,184 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:31:30,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:31:30,573 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-09 23:31:30,573 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:31:30,589 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:31:30,589 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:31:30,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:31:30 BoogieIcfgContainer [2024-11-09 23:31:30,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:31:30,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:31:30,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:31:30,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:31:30,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:31:29" (1/3) ... [2024-11-09 23:31:30,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f04e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:31:30, skipping insertion in model container [2024-11-09 23:31:30,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:29" (2/3) ... [2024-11-09 23:31:30,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f04e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:31:30, skipping insertion in model container [2024-11-09 23:31:30,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:31:30" (3/3) ... [2024-11-09 23:31:30,597 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-09 23:31:30,610 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:31:30,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:31:30,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:31:30,669 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;@f0547fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:31:30,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:31:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7235772357723578) internal successors, (212), 124 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-09 23:31:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:31:30,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:30,684 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] [2024-11-09 23:31:30,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:30,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1720533590, now seen corresponding path program 1 times [2024-11-09 23:31:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:30,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323356112] [2024-11-09 23:31:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:30,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:30,988 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-09 23:31:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323356112] [2024-11-09 23:31:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323356112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:31:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582529956] [2024-11-09 23:31:30,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:30,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:31:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:31,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:31:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:31:31,016 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7235772357723578) internal successors, (212), 124 states have internal predecessors, (212), 0 states have call successors, (0), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-09 23:31:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:31,041 INFO L93 Difference]: Finished difference Result 195 states and 330 transitions. [2024-11-09 23:31:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:31:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 23:31:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:31,051 INFO L225 Difference]: With dead ends: 195 [2024-11-09 23:31:31,051 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 23:31:31,053 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-09 23:31:31,055 INFO L432 NwaCegarLoop]: 204 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, 204 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-09 23:31:31,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 23:31:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 23:31:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.7142857142857142) internal successors, (204), 119 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-09 23:31:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 204 transitions. [2024-11-09 23:31:31,083 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 204 transitions. Word has length 39 [2024-11-09 23:31:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:31,083 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 204 transitions. [2024-11-09 23:31:31,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-09 23:31:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 204 transitions. [2024-11-09 23:31:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:31:31,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:31,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:31,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:31:31,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:31,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -317522699, now seen corresponding path program 1 times [2024-11-09 23:31:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:31,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639061254] [2024-11-09 23:31:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:31,325 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-09 23:31:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639061254] [2024-11-09 23:31:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639061254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:31:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512212681] [2024-11-09 23:31:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:31:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:31:31,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:31:31,329 INFO L87 Difference]: Start difference. First operand 120 states and 204 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-09 23:31:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:31,390 INFO L93 Difference]: Finished difference Result 193 states and 322 transitions. [2024-11-09 23:31:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:31:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 23:31:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:31,396 INFO L225 Difference]: With dead ends: 193 [2024-11-09 23:31:31,396 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 23:31:31,398 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-09 23:31:31,399 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:31,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 23:31:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 23:31:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 0 states have call successors, (0), 0 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-09 23:31:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 183 transitions. [2024-11-09 23:31:31,407 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 183 transitions. Word has length 39 [2024-11-09 23:31:31,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:31,408 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 183 transitions. [2024-11-09 23:31:31,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-09 23:31:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 183 transitions. [2024-11-09 23:31:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:31:31,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:31,411 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] [2024-11-09 23:31:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:31:31,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -269635039, now seen corresponding path program 1 times [2024-11-09 23:31:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591084779] [2024-11-09 23:31:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:31,527 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-09 23:31:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591084779] [2024-11-09 23:31:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591084779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:31,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:31,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:31,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601187441] [2024-11-09 23:31:31,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:31,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:31,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:31,532 INFO L87 Difference]: Start difference. First operand 120 states and 183 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-09 23:31:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:31,592 INFO L93 Difference]: Finished difference Result 249 states and 394 transitions. [2024-11-09 23:31:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-09 23:31:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:31,594 INFO L225 Difference]: With dead ends: 249 [2024-11-09 23:31:31,594 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 23:31:31,595 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-09 23:31:31,595 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 87 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:31,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 325 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 23:31:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2024-11-09 23:31:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5485714285714285) internal successors, (271), 175 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-09 23:31:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2024-11-09 23:31:31,614 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 59 [2024-11-09 23:31:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:31,614 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2024-11-09 23:31:31,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-09 23:31:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2024-11-09 23:31:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:31:31,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:31,620 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] [2024-11-09 23:31:31,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:31:31,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash -222754722, now seen corresponding path program 1 times [2024-11-09 23:31:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445021603] [2024-11-09 23:31:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:31,719 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-09 23:31:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445021603] [2024-11-09 23:31:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445021603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690506055] [2024-11-09 23:31:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:31,721 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-09 23:31:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:31,745 INFO L93 Difference]: Finished difference Result 412 states and 649 transitions. [2024-11-09 23:31:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-09 23:31:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:31,747 INFO L225 Difference]: With dead ends: 412 [2024-11-09 23:31:31,749 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 23:31:31,750 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-09 23:31:31,750 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 89 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:31,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 336 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 23:31:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 282. [2024-11-09 23:31:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 281 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-09 23:31:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 439 transitions. [2024-11-09 23:31:31,763 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 439 transitions. Word has length 61 [2024-11-09 23:31:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:31,763 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 439 transitions. [2024-11-09 23:31:31,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-09 23:31:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 439 transitions. [2024-11-09 23:31:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:31:31,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:31,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:31,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:31:31,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:31,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1136929925, now seen corresponding path program 1 times [2024-11-09 23:31:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868014650] [2024-11-09 23:31:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:31,869 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-09 23:31:31,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:31,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868014650] [2024-11-09 23:31:31,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868014650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:31,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:31,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446431659] [2024-11-09 23:31:31,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:31,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:31,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:31,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:31,871 INFO L87 Difference]: Start difference. First operand 282 states and 439 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:31,892 INFO L93 Difference]: Finished difference Result 716 states and 1127 transitions. [2024-11-09 23:31:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:31,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-09 23:31:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:31,895 INFO L225 Difference]: With dead ends: 716 [2024-11-09 23:31:31,895 INFO L226 Difference]: Without dead ends: 485 [2024-11-09 23:31:31,896 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-09 23:31:31,898 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 83 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:31,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-09 23:31:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2024-11-09 23:31:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.5576519916142557) internal successors, (743), 477 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-09 23:31:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 743 transitions. [2024-11-09 23:31:31,916 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 743 transitions. Word has length 63 [2024-11-09 23:31:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:31,916 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 743 transitions. [2024-11-09 23:31:31,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 743 transitions. [2024-11-09 23:31:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:31:31,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:31,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:31,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:31:31,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:31,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1606849672, now seen corresponding path program 1 times [2024-11-09 23:31:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:31,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076657954] [2024-11-09 23:31:31,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:31,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:32,077 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-09 23:31:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076657954] [2024-11-09 23:31:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076657954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:31:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479529738] [2024-11-09 23:31:32,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:32,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:31:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:31:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:31:32,078 INFO L87 Difference]: Start difference. First operand 478 states and 743 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:32,245 INFO L93 Difference]: Finished difference Result 2040 states and 3267 transitions. [2024-11-09 23:31:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:31:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:31:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:32,255 INFO L225 Difference]: With dead ends: 2040 [2024-11-09 23:31:32,255 INFO L226 Difference]: Without dead ends: 1613 [2024-11-09 23:31:32,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:31:32,257 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 732 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:32,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1170 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2024-11-09 23:31:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 841. [2024-11-09 23:31:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.575) internal successors, (1323), 840 states have internal predecessors, (1323), 0 states have call successors, (0), 0 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-09 23:31:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1323 transitions. [2024-11-09 23:31:32,281 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1323 transitions. Word has length 65 [2024-11-09 23:31:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1323 transitions. [2024-11-09 23:31:32,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1323 transitions. [2024-11-09 23:31:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:31:32,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:32,283 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] [2024-11-09 23:31:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:31:32,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -905301196, now seen corresponding path program 1 times [2024-11-09 23:31:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010909360] [2024-11-09 23:31:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:32,382 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-09 23:31:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:32,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010909360] [2024-11-09 23:31:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010909360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201794351] [2024-11-09 23:31:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:32,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:32,386 INFO L87 Difference]: Start difference. First operand 841 states and 1323 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-09 23:31:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:32,456 INFO L93 Difference]: Finished difference Result 2465 states and 3941 transitions. [2024-11-09 23:31:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:32,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-09 23:31:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:32,462 INFO L225 Difference]: With dead ends: 2465 [2024-11-09 23:31:32,463 INFO L226 Difference]: Without dead ends: 1675 [2024-11-09 23:31:32,464 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-09 23:31:32,464 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 323 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 597 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:32,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 597 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-11-09 23:31:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1248. [2024-11-09 23:31:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.5838011226944668) internal successors, (1975), 1247 states have internal predecessors, (1975), 0 states have call successors, (0), 0 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-09 23:31:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1975 transitions. [2024-11-09 23:31:32,488 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1975 transitions. Word has length 66 [2024-11-09 23:31:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1975 transitions. [2024-11-09 23:31:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-09 23:31:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1975 transitions. [2024-11-09 23:31:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:31:32,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:32,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:32,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:31:32,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:32,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash -689393222, now seen corresponding path program 1 times [2024-11-09 23:31:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765682052] [2024-11-09 23:31:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:32,582 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-09 23:31:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:32,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765682052] [2024-11-09 23:31:32,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765682052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:32,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:32,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079491413] [2024-11-09 23:31:32,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:32,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:32,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:32,583 INFO L87 Difference]: Start difference. First operand 1248 states and 1975 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:32,650 INFO L93 Difference]: Finished difference Result 3627 states and 5793 transitions. [2024-11-09 23:31:32,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:32,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:31:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:32,657 INFO L225 Difference]: With dead ends: 3627 [2024-11-09 23:31:32,657 INFO L226 Difference]: Without dead ends: 2430 [2024-11-09 23:31:32,658 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-09 23:31:32,658 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 323 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 589 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:32,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 589 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2024-11-09 23:31:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1826. [2024-11-09 23:31:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 1.583013698630137) internal successors, (2889), 1825 states have internal predecessors, (2889), 0 states have call successors, (0), 0 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-09 23:31:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2889 transitions. [2024-11-09 23:31:32,690 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2889 transitions. Word has length 67 [2024-11-09 23:31:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:32,690 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2889 transitions. [2024-11-09 23:31:32,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2889 transitions. [2024-11-09 23:31:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:31:32,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:32,692 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] [2024-11-09 23:31:32,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:31:32,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:32,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1450370587, now seen corresponding path program 1 times [2024-11-09 23:31:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:32,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570825216] [2024-11-09 23:31:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:32,736 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-09 23:31:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570825216] [2024-11-09 23:31:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570825216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27900017] [2024-11-09 23:31:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:32,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:32,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:32,737 INFO L87 Difference]: Start difference. First operand 1826 states and 2889 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:32,771 INFO L93 Difference]: Finished difference Result 4158 states and 6632 transitions. [2024-11-09 23:31:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-09 23:31:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:32,779 INFO L225 Difference]: With dead ends: 4158 [2024-11-09 23:31:32,779 INFO L226 Difference]: Without dead ends: 2855 [2024-11-09 23:31:32,781 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-09 23:31:32,781 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 94 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 424 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-09 23:31:32,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2024-11-09 23:31:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2852. [2024-11-09 23:31:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.5762890213960015) internal successors, (4494), 2851 states have internal predecessors, (4494), 0 states have call successors, (0), 0 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-09 23:31:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4494 transitions. [2024-11-09 23:31:32,846 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4494 transitions. Word has length 68 [2024-11-09 23:31:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:32,846 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4494 transitions. [2024-11-09 23:31:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4494 transitions. [2024-11-09 23:31:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:31:32,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:32,849 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] [2024-11-09 23:31:32,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:31:32,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:32,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1990900533, now seen corresponding path program 1 times [2024-11-09 23:31:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:32,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626258966] [2024-11-09 23:31:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:32,898 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-09 23:31:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626258966] [2024-11-09 23:31:32,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626258966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:32,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:32,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732431851] [2024-11-09 23:31:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:32,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:32,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:32,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:32,900 INFO L87 Difference]: Start difference. First operand 2852 states and 4494 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:32,942 INFO L93 Difference]: Finished difference Result 5795 states and 9150 transitions. [2024-11-09 23:31:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:32,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-09 23:31:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:32,954 INFO L225 Difference]: With dead ends: 5795 [2024-11-09 23:31:32,954 INFO L226 Difference]: Without dead ends: 4141 [2024-11-09 23:31:32,956 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-09 23:31:32,956 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 82 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 403 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-09 23:31:32,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 403 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2024-11-09 23:31:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4138. [2024-11-09 23:31:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4138 states, 4137 states have (on average 1.5617597292724197) internal successors, (6461), 4137 states have internal predecessors, (6461), 0 states have call successors, (0), 0 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-09 23:31:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 6461 transitions. [2024-11-09 23:31:33,028 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 6461 transitions. Word has length 68 [2024-11-09 23:31:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 4138 states and 6461 transitions. [2024-11-09 23:31:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6461 transitions. [2024-11-09 23:31:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:31:33,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:33,028 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] [2024-11-09 23:31:33,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:31:33,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1651528374, now seen corresponding path program 1 times [2024-11-09 23:31:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722775672] [2024-11-09 23:31:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722775672] [2024-11-09 23:31:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722775672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750363715] [2024-11-09 23:31:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:33,109 INFO L87 Difference]: Start difference. First operand 4138 states and 6461 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:33,227 INFO L93 Difference]: Finished difference Result 12935 states and 20290 transitions. [2024-11-09 23:31:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-09 23:31:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:33,249 INFO L225 Difference]: With dead ends: 12935 [2024-11-09 23:31:33,249 INFO L226 Difference]: Without dead ends: 8880 [2024-11-09 23:31:33,256 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-09 23:31:33,257 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 321 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 591 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:33,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 591 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2024-11-09 23:31:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 6482. [2024-11-09 23:31:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6482 states, 6481 states have (on average 1.555161240549298) internal successors, (10079), 6481 states have internal predecessors, (10079), 0 states have call successors, (0), 0 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-09 23:31:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 10079 transitions. [2024-11-09 23:31:33,419 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 10079 transitions. Word has length 68 [2024-11-09 23:31:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:33,419 INFO L471 AbstractCegarLoop]: Abstraction has 6482 states and 10079 transitions. [2024-11-09 23:31:33,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 10079 transitions. [2024-11-09 23:31:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:31:33,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:33,420 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] [2024-11-09 23:31:33,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:31:33,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:33,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1051168200, now seen corresponding path program 1 times [2024-11-09 23:31:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342925043] [2024-11-09 23:31:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:33,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:33,484 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-09 23:31:33,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342925043] [2024-11-09 23:31:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342925043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223769802] [2024-11-09 23:31:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:33,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:33,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:33,486 INFO L87 Difference]: Start difference. First operand 6482 states and 10079 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:33,595 INFO L93 Difference]: Finished difference Result 14574 states and 22666 transitions. [2024-11-09 23:31:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:33,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-09 23:31:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:33,624 INFO L225 Difference]: With dead ends: 14574 [2024-11-09 23:31:33,624 INFO L226 Difference]: Without dead ends: 9940 [2024-11-09 23:31:33,631 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-09 23:31:33,631 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 88 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 425 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-09 23:31:33,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 425 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9940 states. [2024-11-09 23:31:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9940 to 9937. [2024-11-09 23:31:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9937 states, 9936 states have (on average 1.5348228663446055) internal successors, (15250), 9936 states have internal predecessors, (15250), 0 states have call successors, (0), 0 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-09 23:31:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 15250 transitions. [2024-11-09 23:31:33,829 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 15250 transitions. Word has length 68 [2024-11-09 23:31:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:33,829 INFO L471 AbstractCegarLoop]: Abstraction has 9937 states and 15250 transitions. [2024-11-09 23:31:33,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-09 23:31:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 15250 transitions. [2024-11-09 23:31:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 23:31:33,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:33,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:33,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:31:33,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:33,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1621079496, now seen corresponding path program 1 times [2024-11-09 23:31:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828187603] [2024-11-09 23:31:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:34,026 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-09 23:31:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828187603] [2024-11-09 23:31:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828187603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:34,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:31:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025185567] [2024-11-09 23:31:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:34,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:31:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:31:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:31:34,028 INFO L87 Difference]: Start difference. First operand 9937 states and 15250 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:34,167 INFO L93 Difference]: Finished difference Result 19811 states and 30414 transitions. [2024-11-09 23:31:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:31:34,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-09 23:31:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:34,181 INFO L225 Difference]: With dead ends: 19811 [2024-11-09 23:31:34,181 INFO L226 Difference]: Without dead ends: 9940 [2024-11-09 23:31:34,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:31:34,191 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 167 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:34,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 487 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9940 states. [2024-11-09 23:31:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9940 to 9937. [2024-11-09 23:31:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9937 states, 9936 states have (on average 1.522242351046699) internal successors, (15125), 9936 states have internal predecessors, (15125), 0 states have call successors, (0), 0 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-09 23:31:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 15125 transitions. [2024-11-09 23:31:34,374 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 15125 transitions. Word has length 70 [2024-11-09 23:31:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:34,374 INFO L471 AbstractCegarLoop]: Abstraction has 9937 states and 15125 transitions. [2024-11-09 23:31:34,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 15125 transitions. [2024-11-09 23:31:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 23:31:34,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:34,375 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] [2024-11-09 23:31:34,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:31:34,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1429220835, now seen corresponding path program 1 times [2024-11-09 23:31:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967462039] [2024-11-09 23:31:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:34,554 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-09 23:31:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967462039] [2024-11-09 23:31:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967462039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:34,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:31:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292915404] [2024-11-09 23:31:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:34,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:31:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:31:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:31:34,556 INFO L87 Difference]: Start difference. First operand 9937 states and 15125 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-09 23:31:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:34,823 INFO L93 Difference]: Finished difference Result 28477 states and 43502 transitions. [2024-11-09 23:31:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:31:34,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-09 23:31:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:34,854 INFO L225 Difference]: With dead ends: 28477 [2024-11-09 23:31:34,854 INFO L226 Difference]: Without dead ends: 18606 [2024-11-09 23:31:34,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:31:34,870 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 159 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:34,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 489 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18606 states. [2024-11-09 23:31:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18606 to 18603. [2024-11-09 23:31:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18603 states, 18602 states have (on average 1.5091925599397915) internal successors, (28074), 18602 states have internal predecessors, (28074), 0 states have call successors, (0), 0 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-09 23:31:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18603 states to 18603 states and 28074 transitions. [2024-11-09 23:31:35,276 INFO L78 Accepts]: Start accepts. Automaton has 18603 states and 28074 transitions. Word has length 75 [2024-11-09 23:31:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:35,277 INFO L471 AbstractCegarLoop]: Abstraction has 18603 states and 28074 transitions. [2024-11-09 23:31:35,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-09 23:31:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18603 states and 28074 transitions. [2024-11-09 23:31:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 23:31:35,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:35,278 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] [2024-11-09 23:31:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:31:35,278 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash -479846586, now seen corresponding path program 1 times [2024-11-09 23:31:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332310474] [2024-11-09 23:31:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:35,451 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-09 23:31:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332310474] [2024-11-09 23:31:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332310474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:35,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:31:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814354143] [2024-11-09 23:31:35,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:35,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:31:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:31:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:31:35,452 INFO L87 Difference]: Start difference. First operand 18603 states and 28074 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-09 23:31:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:35,631 INFO L93 Difference]: Finished difference Result 19692 states and 29524 transitions. [2024-11-09 23:31:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:31:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-09 23:31:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:35,658 INFO L225 Difference]: With dead ends: 19692 [2024-11-09 23:31:35,658 INFO L226 Difference]: Without dead ends: 19689 [2024-11-09 23:31:35,666 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-09 23:31:35,667 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:35,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19689 states. [2024-11-09 23:31:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19689 to 19689. [2024-11-09 23:31:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19689 states, 19688 states have (on average 1.480648110524177) internal successors, (29151), 19688 states have internal predecessors, (29151), 0 states have call successors, (0), 0 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-09 23:31:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19689 states to 19689 states and 29151 transitions. [2024-11-09 23:31:35,986 INFO L78 Accepts]: Start accepts. Automaton has 19689 states and 29151 transitions. Word has length 77 [2024-11-09 23:31:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:35,987 INFO L471 AbstractCegarLoop]: Abstraction has 19689 states and 29151 transitions. [2024-11-09 23:31:35,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-09 23:31:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19689 states and 29151 transitions. [2024-11-09 23:31:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:31:35,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:35,988 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:31:35,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:31:35,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:35,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1906185816, now seen corresponding path program 1 times [2024-11-09 23:31:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:35,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233586827] [2024-11-09 23:31:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233586827] [2024-11-09 23:31:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233586827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:36,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:36,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:36,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813313055] [2024-11-09 23:31:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:36,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:36,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:36,047 INFO L87 Difference]: Start difference. First operand 19689 states and 29151 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:31:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:36,449 INFO L93 Difference]: Finished difference Result 58811 states and 86988 transitions. [2024-11-09 23:31:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-09 23:31:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:36,514 INFO L225 Difference]: With dead ends: 58811 [2024-11-09 23:31:36,515 INFO L226 Difference]: Without dead ends: 39184 [2024-11-09 23:31:36,547 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-09 23:31:36,547 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 113 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:36,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 411 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39184 states. [2024-11-09 23:31:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39184 to 39181. [2024-11-09 23:31:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39181 states, 39180 states have (on average 1.4675344563552832) internal successors, (57498), 39180 states have internal predecessors, (57498), 0 states have call successors, (0), 0 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-09 23:31:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39181 states to 39181 states and 57498 transitions. [2024-11-09 23:31:37,264 INFO L78 Accepts]: Start accepts. Automaton has 39181 states and 57498 transitions. Word has length 105 [2024-11-09 23:31:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:37,264 INFO L471 AbstractCegarLoop]: Abstraction has 39181 states and 57498 transitions. [2024-11-09 23:31:37,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:31:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 39181 states and 57498 transitions. [2024-11-09 23:31:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:31:37,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:37,267 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:31:37,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:31:37,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:37,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1848251534, now seen corresponding path program 1 times [2024-11-09 23:31:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147805378] [2024-11-09 23:31:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:31:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147805378] [2024-11-09 23:31:37,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147805378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:37,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:37,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:37,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152970974] [2024-11-09 23:31:37,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:37,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:37,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:37,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:37,339 INFO L87 Difference]: Start difference. First operand 39181 states and 57498 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-09 23:31:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:38,025 INFO L93 Difference]: Finished difference Result 117087 states and 171655 transitions. [2024-11-09 23:31:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:38,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 105 [2024-11-09 23:31:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:38,158 INFO L225 Difference]: With dead ends: 117087 [2024-11-09 23:31:38,158 INFO L226 Difference]: Without dead ends: 77999 [2024-11-09 23:31:38,185 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-09 23:31:38,186 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 112 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:38,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77999 states. [2024-11-09 23:31:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77999 to 77996. [2024-11-09 23:31:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77996 states, 77995 states have (on average 1.4543624591319957) internal successors, (113433), 77995 states have internal predecessors, (113433), 0 states have call successors, (0), 0 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-09 23:31:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77996 states to 77996 states and 113433 transitions. [2024-11-09 23:31:39,545 INFO L78 Accepts]: Start accepts. Automaton has 77996 states and 113433 transitions. Word has length 105 [2024-11-09 23:31:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:39,546 INFO L471 AbstractCegarLoop]: Abstraction has 77996 states and 113433 transitions. [2024-11-09 23:31:39,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-09 23:31:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 77996 states and 113433 transitions. [2024-11-09 23:31:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:31:39,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:39,550 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:31:39,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:31:39,551 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1506983429, now seen corresponding path program 1 times [2024-11-09 23:31:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506159985] [2024-11-09 23:31:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:39,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:31:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506159985] [2024-11-09 23:31:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506159985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982532318] [2024-11-09 23:31:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:39,804 INFO L87 Difference]: Start difference. First operand 77996 states and 113433 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-09 23:31:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:41,198 INFO L93 Difference]: Finished difference Result 233090 states and 338645 transitions. [2024-11-09 23:31:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 105 [2024-11-09 23:31:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:41,585 INFO L225 Difference]: With dead ends: 233090 [2024-11-09 23:31:41,585 INFO L226 Difference]: Without dead ends: 155259 [2024-11-09 23:31:41,640 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-09 23:31:41,645 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 98 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:41,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 397 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155259 states. [2024-11-09 23:31:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155259 to 155256. [2024-11-09 23:31:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155256 states, 155255 states have (on average 1.4410421564522882) internal successors, (223729), 155255 states have internal predecessors, (223729), 0 states have call successors, (0), 0 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-09 23:31:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155256 states to 155256 states and 223729 transitions. [2024-11-09 23:31:44,374 INFO L78 Accepts]: Start accepts. Automaton has 155256 states and 223729 transitions. Word has length 105 [2024-11-09 23:31:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:44,375 INFO L471 AbstractCegarLoop]: Abstraction has 155256 states and 223729 transitions. [2024-11-09 23:31:44,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-09 23:31:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 155256 states and 223729 transitions. [2024-11-09 23:31:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:31:44,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:44,383 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:31:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:31:44,383 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1885848441, now seen corresponding path program 1 times [2024-11-09 23:31:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065562741] [2024-11-09 23:31:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:44,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:44,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065562741] [2024-11-09 23:31:44,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065562741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:44,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:44,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:44,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287353747] [2024-11-09 23:31:44,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:44,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:44,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:44,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:44,442 INFO L87 Difference]: Start difference. First operand 155256 states and 223729 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:31:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:47,400 INFO L93 Difference]: Finished difference Result 464002 states and 667978 transitions. [2024-11-09 23:31:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-09 23:31:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:48,261 INFO L225 Difference]: With dead ends: 464002 [2024-11-09 23:31:48,261 INFO L226 Difference]: Without dead ends: 309115 [2024-11-09 23:31:48,349 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-09 23:31:48,351 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 132 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:48,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 428 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309115 states. [2024-11-09 23:31:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309115 to 309112. [2024-11-09 23:31:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309112 states, 309111 states have (on average 1.4276877885290398) internal successors, (441314), 309111 states have internal predecessors, (441314), 0 states have call successors, (0), 0 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-09 23:31:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309112 states to 309112 states and 441314 transitions. [2024-11-09 23:31:54,311 INFO L78 Accepts]: Start accepts. Automaton has 309112 states and 441314 transitions. Word has length 105 [2024-11-09 23:31:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:54,311 INFO L471 AbstractCegarLoop]: Abstraction has 309112 states and 441314 transitions. [2024-11-09 23:31:54,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:31:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 309112 states and 441314 transitions. [2024-11-09 23:31:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:31:54,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:54,328 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:31:54,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:31:54,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:54,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2126388570, now seen corresponding path program 1 times [2024-11-09 23:31:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:54,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582297731] [2024-11-09 23:31:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582297731] [2024-11-09 23:31:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582297731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363987663] [2024-11-09 23:31:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:54,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:54,399 INFO L87 Difference]: Start difference. First operand 309112 states and 441314 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:31:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:57,614 INFO L93 Difference]: Finished difference Result 464346 states and 661654 transitions. [2024-11-09 23:31:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-09 23:31:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:58,162 INFO L225 Difference]: With dead ends: 464346 [2024-11-09 23:31:58,162 INFO L226 Difference]: Without dead ends: 309427 [2024-11-09 23:31:58,264 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-09 23:31:58,265 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 103 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:58,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 470 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309427 states. [2024-11-09 23:32:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309427 to 309424. [2024-11-09 23:32:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309424 states, 309423 states have (on average 1.4164881085116492) internal successors, (438294), 309423 states have internal predecessors, (438294), 0 states have call successors, (0), 0 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-09 23:32:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309424 states to 309424 states and 438294 transitions. [2024-11-09 23:32:04,212 INFO L78 Accepts]: Start accepts. Automaton has 309424 states and 438294 transitions. Word has length 105 [2024-11-09 23:32:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:32:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 309424 states and 438294 transitions. [2024-11-09 23:32:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:32:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 309424 states and 438294 transitions. [2024-11-09 23:32:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:32:04,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:32:04,226 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:32:04,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:32:04,227 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:32:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:32:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1658044549, now seen corresponding path program 1 times [2024-11-09 23:32:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:32:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598621429] [2024-11-09 23:32:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:32:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:32:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:32:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:32:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:32:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598621429] [2024-11-09 23:32:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598621429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:32:04,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:32:04,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:32:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119069264] [2024-11-09 23:32:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:32:04,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:32:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:32:04,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:32:04,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:32:04,278 INFO L87 Difference]: Start difference. First operand 309424 states and 438294 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-09 23:32:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:32:07,301 INFO L93 Difference]: Finished difference Result 464842 states and 657165 transitions. [2024-11-09 23:32:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:32:07,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-09 23:32:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:32:08,219 INFO L225 Difference]: With dead ends: 464842 [2024-11-09 23:32:08,219 INFO L226 Difference]: Without dead ends: 309955 [2024-11-09 23:32:08,343 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-09 23:32:08,344 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 117 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:32:08,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 488 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:32:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309955 states.