./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.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.4.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:31:39,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:31:39,101 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:39,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:31:39,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:31:39,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:31:39,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:31:39,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:31:39,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:31:39,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:31:39,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:31:39,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:31:39,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:31:39,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:31:39,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:31:39,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:31:39,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:31:39,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:31:39,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:31:39,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:31:39,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:31:39,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:31:39,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:31:39,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:31:39,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:31:39,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:31:39,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:31:39,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:31:39,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:31:39,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:31:39,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:31:39,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:31:39,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:31:39,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:31:39,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:31:39,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:31:39,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:31:39,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:31:39,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:31:39,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:31:39,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:31:39,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:31:39,150 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 -> d0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0 [2024-11-09 23:31:39,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:31:39,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:31:39,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:31:39,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:31:39,428 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:31:39,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-09 23:31:40,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:31:41,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:31:41,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-09 23:31:41,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64cabfcb/0620d7beb2114ab8a9abeef96912984d/FLAG607f7b963 [2024-11-09 23:31:41,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64cabfcb/0620d7beb2114ab8a9abeef96912984d [2024-11-09 23:31:41,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:31:41,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:31:41,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:31:41,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:31:41,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:31:41,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:31:41" (1/1) ... [2024-11-09 23:31:41,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b59bc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:41, skipping insertion in model container [2024-11-09 23:31:41,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:31:41" (1/1) ... [2024-11-09 23:31:41,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:31:41,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c[24198,24211] [2024-11-09 23:31:41,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:31:41,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:31:41,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c[24198,24211] [2024-11-09 23:31:41,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:31:41,787 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:31:41,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:41 WrapperNode [2024-11-09 23:31:41,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:31:41,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:31:41,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:31:41,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:31:41,795 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:41" (1/1) ... [2024-11-09 23:31:41,809 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:41" (1/1) ... [2024-11-09 23:31:41,858 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 933 [2024-11-09 23:31:41,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:31:41,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:31:41,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:31:41,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:31:41,870 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:41" (1/1) ... [2024-11-09 23:31:41,870 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:41" (1/1) ... [2024-11-09 23:31:41,877 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:41" (1/1) ... [2024-11-09 23:31:41,899 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:41,900 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:41" (1/1) ... [2024-11-09 23:31:41,900 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:41" (1/1) ... [2024-11-09 23:31:41,915 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:41" (1/1) ... [2024-11-09 23:31:41,919 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:41" (1/1) ... [2024-11-09 23:31:41,922 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:41" (1/1) ... [2024-11-09 23:31:41,925 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:41" (1/1) ... [2024-11-09 23:31:41,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:31:41,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:31:41,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:31:41,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:31:41,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:41" (1/1) ... [2024-11-09 23:31:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:31:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:31:41,976 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:41,983 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:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:31:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:31:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:31:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:31:42,176 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:31:42,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:31:43,187 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-11-09 23:31:43,187 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:31:43,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:31:43,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:31:43,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:31:43 BoogieIcfgContainer [2024-11-09 23:31:43,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:31:43,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:31:43,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:31:43,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:31:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:31:41" (1/3) ... [2024-11-09 23:31:43,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c174c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:31:43, skipping insertion in model container [2024-11-09 23:31:43,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:41" (2/3) ... [2024-11-09 23:31:43,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c174c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:31:43, skipping insertion in model container [2024-11-09 23:31:43,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:31:43" (3/3) ... [2024-11-09 23:31:43,222 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-09 23:31:43,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:31:43,239 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:31:43,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:31:43,314 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;@60c8ec98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:31:43,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:31:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 296 states have (on average 1.7432432432432432) internal successors, (516), 297 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:31:43,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:43,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:43,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash -94647063, now seen corresponding path program 1 times [2024-11-09 23:31:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:43,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759309823] [2024-11-09 23:31:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:43,891 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:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759309823] [2024-11-09 23:31:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759309823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:43,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:31:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989969056] [2024-11-09 23:31:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:43,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:31:43,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:31:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:31:43,932 INFO L87 Difference]: Start difference. First operand has 298 states, 296 states have (on average 1.7432432432432432) internal successors, (516), 297 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:43,979 INFO L93 Difference]: Finished difference Result 392 states and 677 transitions. [2024-11-09 23:31:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:31:43,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:31:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:43,991 INFO L225 Difference]: With dead ends: 392 [2024-11-09 23:31:43,992 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 23:31:43,994 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:43,997 INFO L432 NwaCegarLoop]: 512 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, 512 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:44,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 512 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:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 23:31:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-09 23:31:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.7397260273972603) internal successors, (508), 292 states have internal predecessors, (508), 0 states have call successors, (0), 0 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 508 transitions. [2024-11-09 23:31:44,045 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 508 transitions. Word has length 79 [2024-11-09 23:31:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:44,046 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 508 transitions. [2024-11-09 23:31:44,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 508 transitions. [2024-11-09 23:31:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:31:44,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:44,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:44,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:31:44,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:44,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash -63627256, now seen corresponding path program 1 times [2024-11-09 23:31:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415361012] [2024-11-09 23:31:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:44,464 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:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415361012] [2024-11-09 23:31:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415361012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:31:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234238836] [2024-11-09 23:31:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:44,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:31:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:31:44,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:31:44,470 INFO L87 Difference]: Start difference. First operand 293 states and 508 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:44,589 INFO L93 Difference]: Finished difference Result 386 states and 666 transitions. [2024-11-09 23:31:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:31:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:31:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:44,593 INFO L225 Difference]: With dead ends: 386 [2024-11-09 23:31:44,594 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 23:31:44,595 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:44,596 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 0 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:44,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1989 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 23:31:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-09 23:31:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6369863013698631) internal successors, (478), 292 states have internal predecessors, (478), 0 states have call successors, (0), 0 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,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 478 transitions. [2024-11-09 23:31:44,616 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 478 transitions. Word has length 79 [2024-11-09 23:31:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:44,618 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 478 transitions. [2024-11-09 23:31:44,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 478 transitions. [2024-11-09 23:31:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 23:31:44,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:44,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:44,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:31:44,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:44,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1044560206, now seen corresponding path program 1 times [2024-11-09 23:31:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546021657] [2024-11-09 23:31:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:44,915 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:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546021657] [2024-11-09 23:31:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546021657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:44,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:44,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896787409] [2024-11-09 23:31:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:44,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:44,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:44,921 INFO L87 Difference]: Start difference. First operand 293 states and 478 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:44,993 INFO L93 Difference]: Finished difference Result 460 states and 765 transitions. [2024-11-09 23:31:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:44,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-09 23:31:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:44,996 INFO L225 Difference]: With dead ends: 460 [2024-11-09 23:31:44,996 INFO L226 Difference]: Without dead ends: 371 [2024-11-09 23:31:44,998 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:44,999 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 124 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:45,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 919 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-09 23:31:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2024-11-09 23:31:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.6457765667574933) internal successors, (604), 367 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 604 transitions. [2024-11-09 23:31:45,017 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 604 transitions. Word has length 108 [2024-11-09 23:31:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:45,018 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 604 transitions. [2024-11-09 23:31:45,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 604 transitions. [2024-11-09 23:31:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 23:31:45,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:45,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:31:45,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:45,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:45,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1357226343, now seen corresponding path program 1 times [2024-11-09 23:31:45,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:45,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971966378] [2024-11-09 23:31:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:45,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:45,210 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:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971966378] [2024-11-09 23:31:45,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971966378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:45,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:45,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:45,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893795833] [2024-11-09 23:31:45,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:45,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:45,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:45,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:45,214 INFO L87 Difference]: Start difference. First operand 368 states and 604 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:45,262 INFO L93 Difference]: Finished difference Result 678 states and 1130 transitions. [2024-11-09 23:31:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:45,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-09 23:31:45,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:45,266 INFO L225 Difference]: With dead ends: 678 [2024-11-09 23:31:45,266 INFO L226 Difference]: Without dead ends: 514 [2024-11-09 23:31:45,267 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:45,268 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 125 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:45,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 924 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-09 23:31:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 511. [2024-11-09 23:31:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6588235294117648) internal successors, (846), 510 states have internal predecessors, (846), 0 states have call successors, (0), 0 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:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 846 transitions. [2024-11-09 23:31:45,292 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 846 transitions. Word has length 111 [2024-11-09 23:31:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:45,293 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 846 transitions. [2024-11-09 23:31:45,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 846 transitions. [2024-11-09 23:31:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:31:45,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:45,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:45,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:31:45,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -965263398, now seen corresponding path program 1 times [2024-11-09 23:31:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196550413] [2024-11-09 23:31:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:45,508 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:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196550413] [2024-11-09 23:31:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196550413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:45,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:45,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:45,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569146085] [2024-11-09 23:31:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:45,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:45,516 INFO L87 Difference]: Start difference. First operand 511 states and 846 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:45,558 INFO L93 Difference]: Finished difference Result 1089 states and 1822 transitions. [2024-11-09 23:31:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-09 23:31:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:45,563 INFO L225 Difference]: With dead ends: 1089 [2024-11-09 23:31:45,564 INFO L226 Difference]: Without dead ends: 782 [2024-11-09 23:31:45,565 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:45,566 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 118 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:45,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 925 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-09 23:31:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 779. [2024-11-09 23:31:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.6632390745501284) internal successors, (1294), 778 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1294 transitions. [2024-11-09 23:31:45,594 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1294 transitions. Word has length 114 [2024-11-09 23:31:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:45,595 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1294 transitions. [2024-11-09 23:31:45,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1294 transitions. [2024-11-09 23:31:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 23:31:45,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:45,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:45,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:31:45,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:45,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash -658847821, now seen corresponding path program 1 times [2024-11-09 23:31:45,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:45,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583166780] [2024-11-09 23:31:45,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:45,782 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:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583166780] [2024-11-09 23:31:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583166780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:45,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65676238] [2024-11-09 23:31:45,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:45,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:45,785 INFO L87 Difference]: Start difference. First operand 779 states and 1294 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:45,829 INFO L93 Difference]: Finished difference Result 1857 states and 3098 transitions. [2024-11-09 23:31:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-09 23:31:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:45,838 INFO L225 Difference]: With dead ends: 1857 [2024-11-09 23:31:45,839 INFO L226 Difference]: Without dead ends: 1282 [2024-11-09 23:31:45,840 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:45,841 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 111 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:45,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 966 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:31:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-11-09 23:31:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1279. [2024-11-09 23:31:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.6572769953051643) internal successors, (2118), 1278 states have internal predecessors, (2118), 0 states have call successors, (0), 0 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:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2118 transitions. [2024-11-09 23:31:45,881 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2118 transitions. Word has length 117 [2024-11-09 23:31:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 2118 transitions. [2024-11-09 23:31:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2118 transitions. [2024-11-09 23:31:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 23:31:45,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:45,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:45,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:31:45,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:45,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -861310102, now seen corresponding path program 1 times [2024-11-09 23:31:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614231209] [2024-11-09 23:31:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614231209] [2024-11-09 23:31:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614231209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256345555] [2024-11-09 23:31:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:46,067 INFO L87 Difference]: Start difference. First operand 1279 states and 2118 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:46,115 INFO L93 Difference]: Finished difference Result 2446 states and 4071 transitions. [2024-11-09 23:31:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:46,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-09 23:31:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:46,124 INFO L225 Difference]: With dead ends: 2446 [2024-11-09 23:31:46,124 INFO L226 Difference]: Without dead ends: 1871 [2024-11-09 23:31:46,126 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:46,127 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 112 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 976 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:46,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 976 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:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-11-09 23:31:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1868. [2024-11-09 23:31:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1867 states have (on average 1.6513122656668453) internal successors, (3083), 1867 states have internal predecessors, (3083), 0 states have call successors, (0), 0 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:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 3083 transitions. [2024-11-09 23:31:46,172 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 3083 transitions. Word has length 120 [2024-11-09 23:31:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 3083 transitions. [2024-11-09 23:31:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3083 transitions. [2024-11-09 23:31:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 23:31:46,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:46,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:31:46,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 778869350, now seen corresponding path program 1 times [2024-11-09 23:31:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214546196] [2024-11-09 23:31:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:46,447 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:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214546196] [2024-11-09 23:31:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214546196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:31:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307543449] [2024-11-09 23:31:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:31:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:31:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:31:46,451 INFO L87 Difference]: Start difference. First operand 1868 states and 3083 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:46,812 INFO L93 Difference]: Finished difference Result 9371 states and 15750 transitions. [2024-11-09 23:31:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:31:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-09 23:31:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:46,845 INFO L225 Difference]: With dead ends: 9371 [2024-11-09 23:31:46,845 INFO L226 Difference]: Without dead ends: 7836 [2024-11-09 23:31:46,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:31:46,852 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 1256 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:46,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 3478 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:31:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2024-11-09 23:31:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 3356. [2024-11-09 23:31:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3355 states have (on average 1.6572280178837555) internal successors, (5560), 3355 states have internal predecessors, (5560), 0 states have call successors, (0), 0 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:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 5560 transitions. [2024-11-09 23:31:46,980 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 5560 transitions. Word has length 120 [2024-11-09 23:31:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:46,980 INFO L471 AbstractCegarLoop]: Abstraction has 3356 states and 5560 transitions. [2024-11-09 23:31:46,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 5560 transitions. [2024-11-09 23:31:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:31:46,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:46,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:46,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:31:46,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:46,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 94802756, now seen corresponding path program 1 times [2024-11-09 23:31:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296365708] [2024-11-09 23:31:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:47,214 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:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296365708] [2024-11-09 23:31:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296365708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:47,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848777752] [2024-11-09 23:31:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:47,236 INFO L87 Difference]: Start difference. First operand 3356 states and 5560 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:47,382 INFO L93 Difference]: Finished difference Result 9619 states and 16091 transitions. [2024-11-09 23:31:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 23:31:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:47,413 INFO L225 Difference]: With dead ends: 9619 [2024-11-09 23:31:47,413 INFO L226 Difference]: Without dead ends: 6677 [2024-11-09 23:31:47,421 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:47,422 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 437 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:47,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1530 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2024-11-09 23:31:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 5019. [2024-11-09 23:31:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5019 states, 5018 states have (on average 1.6602231964926266) internal successors, (8331), 5018 states have internal predecessors, (8331), 0 states have call successors, (0), 0 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,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 8331 transitions. [2024-11-09 23:31:47,582 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 8331 transitions. Word has length 121 [2024-11-09 23:31:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:47,583 INFO L471 AbstractCegarLoop]: Abstraction has 5019 states and 8331 transitions. [2024-11-09 23:31:47,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 8331 transitions. [2024-11-09 23:31:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:31:47,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:47,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:47,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:31:47,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:47,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 175784627, now seen corresponding path program 1 times [2024-11-09 23:31:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279391512] [2024-11-09 23:31:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:47,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279391512] [2024-11-09 23:31:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279391512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:47,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769028505] [2024-11-09 23:31:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:47,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:47,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:47,705 INFO L87 Difference]: Start difference. First operand 5019 states and 8331 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:47,836 INFO L93 Difference]: Finished difference Result 9465 states and 15739 transitions. [2024-11-09 23:31:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 23:31:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:47,863 INFO L225 Difference]: With dead ends: 9465 [2024-11-09 23:31:47,863 INFO L226 Difference]: Without dead ends: 6874 [2024-11-09 23:31:47,869 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:47,870 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 119 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1003 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:47,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1003 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:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6874 states. [2024-11-09 23:31:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6874 to 6871. [2024-11-09 23:31:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 6870 states have (on average 1.6481804949053858) internal successors, (11323), 6870 states have internal predecessors, (11323), 0 states have call successors, (0), 0 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:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 11323 transitions. [2024-11-09 23:31:48,083 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 11323 transitions. Word has length 121 [2024-11-09 23:31:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:48,083 INFO L471 AbstractCegarLoop]: Abstraction has 6871 states and 11323 transitions. [2024-11-09 23:31:48,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 11323 transitions. [2024-11-09 23:31:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:31:48,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:48,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:31:48,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2119309217, now seen corresponding path program 1 times [2024-11-09 23:31:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351125722] [2024-11-09 23:31:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:31:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351125722] [2024-11-09 23:31:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351125722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:48,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868476182] [2024-11-09 23:31:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:48,222 INFO L87 Difference]: Start difference. First operand 6871 states and 11323 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:48,356 INFO L93 Difference]: Finished difference Result 13195 states and 21785 transitions. [2024-11-09 23:31:48,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:48,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 23:31:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:48,428 INFO L225 Difference]: With dead ends: 13195 [2024-11-09 23:31:48,428 INFO L226 Difference]: Without dead ends: 9563 [2024-11-09 23:31:48,434 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,435 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 126 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1030 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:48,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1030 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:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9563 states. [2024-11-09 23:31:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9563 to 9560. [2024-11-09 23:31:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9560 states, 9559 states have (on average 1.637200543989957) internal successors, (15650), 9559 states have internal predecessors, (15650), 0 states have call successors, (0), 0 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:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 15650 transitions. [2024-11-09 23:31:48,652 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 15650 transitions. Word has length 121 [2024-11-09 23:31:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:48,653 INFO L471 AbstractCegarLoop]: Abstraction has 9560 states and 15650 transitions. [2024-11-09 23:31:48,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 15650 transitions. [2024-11-09 23:31:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:31:48,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:48,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:48,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:31:48,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:48,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash 139512115, now seen corresponding path program 1 times [2024-11-09 23:31:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941843624] [2024-11-09 23:31:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:48,771 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:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941843624] [2024-11-09 23:31:48,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941843624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:48,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:48,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:31:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15501473] [2024-11-09 23:31:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:48,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:31:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:48,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:31:48,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:48,774 INFO L87 Difference]: Start difference. First operand 9560 states and 15650 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:48,996 INFO L93 Difference]: Finished difference Result 21505 states and 35360 transitions. [2024-11-09 23:31:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:31:48,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 23:31:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:49,029 INFO L225 Difference]: With dead ends: 21505 [2024-11-09 23:31:49,029 INFO L226 Difference]: Without dead ends: 14751 [2024-11-09 23:31:49,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:31:49,042 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 133 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1048 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:49,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1048 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:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14751 states. [2024-11-09 23:31:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14751 to 14748. [2024-11-09 23:31:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14748 states, 14747 states have (on average 1.62555095951719) internal successors, (23972), 14747 states have internal predecessors, (23972), 0 states have call successors, (0), 0 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:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14748 states to 14748 states and 23972 transitions. [2024-11-09 23:31:49,552 INFO L78 Accepts]: Start accepts. Automaton has 14748 states and 23972 transitions. Word has length 121 [2024-11-09 23:31:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:49,553 INFO L471 AbstractCegarLoop]: Abstraction has 14748 states and 23972 transitions. [2024-11-09 23:31:49,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 14748 states and 23972 transitions. [2024-11-09 23:31:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:31:49,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:49,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:49,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:31:49,556 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:49,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash 306316520, now seen corresponding path program 1 times [2024-11-09 23:31:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:49,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044886914] [2024-11-09 23:31:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:49,729 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:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044886914] [2024-11-09 23:31:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044886914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127342969] [2024-11-09 23:31:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:49,736 INFO L87 Difference]: Start difference. First operand 14748 states and 23972 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:50,303 INFO L93 Difference]: Finished difference Result 48462 states and 78953 transitions. [2024-11-09 23:31:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:50,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-09 23:31:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:50,387 INFO L225 Difference]: With dead ends: 48462 [2024-11-09 23:31:50,387 INFO L226 Difference]: Without dead ends: 33942 [2024-11-09 23:31:50,416 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:50,417 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 435 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:50,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1509 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33942 states. [2024-11-09 23:31:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33942 to 24255. [2024-11-09 23:31:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24255 states, 24254 states have (on average 1.6169703966356066) internal successors, (39218), 24254 states have internal predecessors, (39218), 0 states have call successors, (0), 0 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:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24255 states to 24255 states and 39218 transitions. [2024-11-09 23:31:51,167 INFO L78 Accepts]: Start accepts. Automaton has 24255 states and 39218 transitions. Word has length 122 [2024-11-09 23:31:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 24255 states and 39218 transitions. [2024-11-09 23:31:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24255 states and 39218 transitions. [2024-11-09 23:31:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 23:31:51,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:51,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:31:51,170 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1783949690, now seen corresponding path program 1 times [2024-11-09 23:31:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062544591] [2024-11-09 23:31:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:51,561 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:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062544591] [2024-11-09 23:31:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062544591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60891400] [2024-11-09 23:31:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:51,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:51,564 INFO L87 Difference]: Start difference. First operand 24255 states and 39218 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:52,242 INFO L93 Difference]: Finished difference Result 79472 states and 128777 transitions. [2024-11-09 23:31:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-09 23:31:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:52,378 INFO L225 Difference]: With dead ends: 79472 [2024-11-09 23:31:52,378 INFO L226 Difference]: Without dead ends: 55445 [2024-11-09 23:31:52,420 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:52,421 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 433 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:52,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1511 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55445 states. [2024-11-09 23:31:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55445 to 39706. [2024-11-09 23:31:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39706 states, 39705 states have (on average 1.6083616672963104) internal successors, (63860), 39705 states have internal predecessors, (63860), 0 states have call successors, (0), 0 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:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39706 states to 39706 states and 63860 transitions. [2024-11-09 23:31:53,607 INFO L78 Accepts]: Start accepts. Automaton has 39706 states and 63860 transitions. Word has length 123 [2024-11-09 23:31:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 39706 states and 63860 transitions. [2024-11-09 23:31:53,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39706 states and 63860 transitions. [2024-11-09 23:31:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 23:31:53,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:53,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:53,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:31:53,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2080016234, now seen corresponding path program 1 times [2024-11-09 23:31:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157553526] [2024-11-09 23:31:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:53,787 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:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157553526] [2024-11-09 23:31:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157553526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:53,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:53,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:31:53,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382438161] [2024-11-09 23:31:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:53,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:31:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:31:53,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:31:53,791 INFO L87 Difference]: Start difference. First operand 39706 states and 63860 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:55,143 INFO L93 Difference]: Finished difference Result 128674 states and 207385 transitions. [2024-11-09 23:31:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:31:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-09 23:31:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:55,434 INFO L225 Difference]: With dead ends: 128674 [2024-11-09 23:31:55,434 INFO L226 Difference]: Without dead ends: 89196 [2024-11-09 23:31:55,508 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:55,509 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 431 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:55,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1514 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89196 states. [2024-11-09 23:31:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89196 to 64225. [2024-11-09 23:31:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64225 states, 64224 states have (on average 1.59993148978575) internal successors, (102754), 64224 states have internal predecessors, (102754), 0 states have call successors, (0), 0 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,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64225 states to 64225 states and 102754 transitions. [2024-11-09 23:31:57,392 INFO L78 Accepts]: Start accepts. Automaton has 64225 states and 102754 transitions. Word has length 124 [2024-11-09 23:31:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:31:57,393 INFO L471 AbstractCegarLoop]: Abstraction has 64225 states and 102754 transitions. [2024-11-09 23:31:57,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 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,393 INFO L276 IsEmpty]: Start isEmpty. Operand 64225 states and 102754 transitions. [2024-11-09 23:31:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 23:31:57,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:31:57,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:31:57,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:31:57,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:31:57,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:31:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2133860844, now seen corresponding path program 1 times [2024-11-09 23:31:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:31:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256302148] [2024-11-09 23:31:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:31:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:31:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:31:57,865 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:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:31:57,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256302148] [2024-11-09 23:31:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256302148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:31:57,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:31:57,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:31:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839528588] [2024-11-09 23:31:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:31:57,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:31:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:31:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:31:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:31:57,870 INFO L87 Difference]: Start difference. First operand 64225 states and 102754 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:31:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:31:59,219 INFO L93 Difference]: Finished difference Result 128225 states and 205153 transitions. [2024-11-09 23:31:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:31:59,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-11-09 23:31:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:31:59,337 INFO L225 Difference]: With dead ends: 128225 [2024-11-09 23:31:59,337 INFO L226 Difference]: Without dead ends: 64228 [2024-11-09 23:31:59,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:31:59,363 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 225 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:31:59,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1798 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:31:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64228 states. [2024-11-09 23:32:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64228 to 64225. [2024-11-09 23:32:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64225 states, 64224 states have (on average 1.5901999252615844) internal successors, (102129), 64224 states have internal predecessors, (102129), 0 states have call successors, (0), 0 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:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64225 states to 64225 states and 102129 transitions. [2024-11-09 23:32:01,055 INFO L78 Accepts]: Start accepts. Automaton has 64225 states and 102129 transitions. Word has length 126 [2024-11-09 23:32:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:32:01,056 INFO L471 AbstractCegarLoop]: Abstraction has 64225 states and 102129 transitions. [2024-11-09 23:32:01,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:32:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64225 states and 102129 transitions. [2024-11-09 23:32:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 23:32:01,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:32:01,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:32:01,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:32:01,059 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:32:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:32:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash 332859055, now seen corresponding path program 1 times [2024-11-09 23:32:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:32:01,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084195910] [2024-11-09 23:32:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:32:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:32:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:32:01,488 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:32:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:32:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084195910] [2024-11-09 23:32:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084195910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:32:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:32:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:32:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054089162] [2024-11-09 23:32:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:32:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:32:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:32:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:32:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:32:01,492 INFO L87 Difference]: Start difference. First operand 64225 states and 102129 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:32:03,379 INFO L93 Difference]: Finished difference Result 187703 states and 298997 transitions. [2024-11-09 23:32:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:32:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-11-09 23:32:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:32:03,591 INFO L225 Difference]: With dead ends: 187703 [2024-11-09 23:32:03,591 INFO L226 Difference]: Without dead ends: 123706 [2024-11-09 23:32:03,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:32:03,636 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 324 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:32:03,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1809 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:32:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123706 states. [2024-11-09 23:32:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123706 to 123703. [2024-11-09 23:32:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123703 states, 123702 states have (on average 1.5780343082569401) internal successors, (195206), 123702 states have internal predecessors, (195206), 0 states have call successors, (0), 0 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:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123703 states to 123703 states and 195206 transitions. [2024-11-09 23:32:06,504 INFO L78 Accepts]: Start accepts. Automaton has 123703 states and 195206 transitions. Word has length 131 [2024-11-09 23:32:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:32:06,504 INFO L471 AbstractCegarLoop]: Abstraction has 123703 states and 195206 transitions. [2024-11-09 23:32:06,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 123703 states and 195206 transitions. [2024-11-09 23:32:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 23:32:06,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:32:06,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:32:06,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:32:06,507 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:32:06,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:32:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1816529646, now seen corresponding path program 1 times [2024-11-09 23:32:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:32:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860694354] [2024-11-09 23:32:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:32:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:32:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:32:07,097 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:32:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:32:07,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860694354] [2024-11-09 23:32:07,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860694354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:32:07,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:32:07,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:32:07,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309726106] [2024-11-09 23:32:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:32:07,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:32:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:32:07,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:32:07,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:32:07,099 INFO L87 Difference]: Start difference. First operand 123703 states and 195206 transitions. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:32:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:32:08,476 INFO L93 Difference]: Finished difference Result 129514 states and 202952 transitions. [2024-11-09 23:32:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:32:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-11-09 23:32:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:32:08,696 INFO L225 Difference]: With dead ends: 129514 [2024-11-09 23:32:08,696 INFO L226 Difference]: Without dead ends: 129511 [2024-11-09 23:32:08,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:32:08,734 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 0 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3285 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:32:08,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3285 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:32:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129511 states. [2024-11-09 23:32:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129511 to 129511. [2024-11-09 23:32:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129511 states, 129510 states have (on average 1.5519033279283454) internal successors, (200987), 129510 states have internal predecessors, (200987), 0 states have call successors, (0), 0 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:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129511 states to 129511 states and 200987 transitions. [2024-11-09 23:32:11,725 INFO L78 Accepts]: Start accepts. Automaton has 129511 states and 200987 transitions. Word has length 133 [2024-11-09 23:32:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:32:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 129511 states and 200987 transitions. [2024-11-09 23:32:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:32:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 129511 states and 200987 transitions. [2024-11-09 23:32:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 23:32:11,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:32:11,733 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:32:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:32:11,733 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:32:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:32:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1541827723, now seen corresponding path program 1 times [2024-11-09 23:32:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:32:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883146417] [2024-11-09 23:32:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:32:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:32:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:32:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 23:32:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:32:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883146417] [2024-11-09 23:32:11,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883146417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:32:11,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:32:11,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:32:11,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895418178] [2024-11-09 23:32:11,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:32:11,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:32:11,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:32:11,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:32:11,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:32:11,879 INFO L87 Difference]: Start difference. First operand 129511 states and 200987 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:32:14,332 INFO L93 Difference]: Finished difference Result 387510 states and 600946 transitions. [2024-11-09 23:32:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:32:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 169 [2024-11-09 23:32:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:32:15,149 INFO L225 Difference]: With dead ends: 387510 [2024-11-09 23:32:15,149 INFO L226 Difference]: Without dead ends: 258060 [2024-11-09 23:32:15,249 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:15,249 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 348 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:32:15,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:32:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258060 states. [2024-11-09 23:32:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258060 to 258057. [2024-11-09 23:32:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258057 states, 258056 states have (on average 1.5415258703537216) internal successors, (397800), 258056 states have internal predecessors, (397800), 0 states have call successors, (0), 0 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:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258057 states to 258057 states and 397800 transitions. [2024-11-09 23:32:20,793 INFO L78 Accepts]: Start accepts. Automaton has 258057 states and 397800 transitions. Word has length 169 [2024-11-09 23:32:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:32:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 258057 states and 397800 transitions. [2024-11-09 23:32:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 258057 states and 397800 transitions. [2024-11-09 23:32:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 23:32:20,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:32:20,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:32:20,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:32:20,810 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:32:20,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:32:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash -679364791, now seen corresponding path program 1 times [2024-11-09 23:32:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:32:20,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719677323] [2024-11-09 23:32:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:32:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:32:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:32:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:32:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:32:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719677323] [2024-11-09 23:32:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719677323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:32:20,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:32:20,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:32:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305784034] [2024-11-09 23:32:20,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:32:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:32:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:32:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:32:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:32:20,980 INFO L87 Difference]: Start difference. First operand 258057 states and 397800 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:32:26,545 INFO L93 Difference]: Finished difference Result 772176 states and 1189457 transitions. [2024-11-09 23:32:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:32:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 169 [2024-11-09 23:32:26,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:32:27,613 INFO L225 Difference]: With dead ends: 772176 [2024-11-09 23:32:27,613 INFO L226 Difference]: Without dead ends: 514240 [2024-11-09 23:32:27,806 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:27,807 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 360 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:32:27,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1218 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:32:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514240 states.