./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4319f1617264b859ec72b12374ecf2c184fa129f0736ad4fd8fa304d4c3211b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:46:36,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:46:36,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:46:36,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:46:36,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:46:36,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:46:36,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:46:36,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:46:36,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:46:36,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:46:36,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:46:36,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:46:36,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:46:36,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:46:36,963 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:46:36,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:46:36,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:46:36,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:46:36,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:46:36,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:46:36,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:46:36,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:46:36,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:46:36,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:46:36,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:46:36,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:46:36,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:46:36,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:46:36,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:46:36,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:46:36,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:46:36,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:46:36,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:46:36,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:46:36,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:46:36,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:46:36,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:46:36,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:46:36,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:46:36,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:46:36,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:46:36,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:46:36,973 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 -> f4319f1617264b859ec72b12374ecf2c184fa129f0736ad4fd8fa304d4c3211b [2024-10-14 03:46:37,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:46:37,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:46:37,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:46:37,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:46:37,239 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:46:37,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-14 03:46:38,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:46:39,086 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:46:39,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-14 03:46:39,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c970afe/8963fbffdbeb46b18b5ef25058b3c933/FLAG5ce415b29 [2024-10-14 03:46:39,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c970afe/8963fbffdbeb46b18b5ef25058b3c933 [2024-10-14 03:46:39,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:46:39,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:46:39,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:46:39,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:46:39,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:46:39,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:39,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53830c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39, skipping insertion in model container [2024-10-14 03:46:39,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:39,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:46:39,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[21524,21537] [2024-10-14 03:46:39,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:46:39,755 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:46:39,868 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[21524,21537] [2024-10-14 03:46:39,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:46:39,949 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:46:39,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39 WrapperNode [2024-10-14 03:46:39,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:46:39,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:46:39,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:46:39,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:46:39,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:39,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,058 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2816 [2024-10-14 03:46:40,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:46:40,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:46:40,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:46:40,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:46:40,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,134 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:46:40,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:46:40,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:46:40,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:46:40,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:46:40,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (1/1) ... [2024-10-14 03:46:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:46:40,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:46:40,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:46:40,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:46:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:46:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:46:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:46:40,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:46:40,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:46:40,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:46:42,322 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2024-10-14 03:46:42,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:46:42,390 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:46:42,391 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:46:42,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:46:42 BoogieIcfgContainer [2024-10-14 03:46:42,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:46:42,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:46:42,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:46:42,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:46:42,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:46:39" (1/3) ... [2024-10-14 03:46:42,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da9ae46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:46:42, skipping insertion in model container [2024-10-14 03:46:42,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:46:39" (2/3) ... [2024-10-14 03:46:42,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da9ae46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:46:42, skipping insertion in model container [2024-10-14 03:46:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:46:42" (3/3) ... [2024-10-14 03:46:42,398 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-14 03:46:42,410 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:46:42,410 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:46:42,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:46:42,473 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;@cbc0943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:46:42,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:46:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 714 states, 712 states have (on average 1.8398876404494382) internal successors, (1310), 713 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 03:46:42,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:42,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:42,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:42,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 744675547, now seen corresponding path program 1 times [2024-10-14 03:46:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944552763] [2024-10-14 03:46:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:43,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944552763] [2024-10-14 03:46:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944552763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:43,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765675632] [2024-10-14 03:46:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:43,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:43,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:43,283 INFO L87 Difference]: Start difference. First operand has 714 states, 712 states have (on average 1.8398876404494382) internal successors, (1310), 713 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:43,419 INFO L93 Difference]: Finished difference Result 1085 states and 1939 transitions. [2024-10-14 03:46:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2024-10-14 03:46:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:43,456 INFO L225 Difference]: With dead ends: 1085 [2024-10-14 03:46:43,456 INFO L226 Difference]: Without dead ends: 889 [2024-10-14 03:46:43,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:43,466 INFO L432 NwaCegarLoop]: 1558 mSDtfsCounter, 318 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:43,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 2800 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:46:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-10-14 03:46:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 887. [2024-10-14 03:46:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 1.7595936794582392) internal successors, (1559), 886 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1559 transitions. [2024-10-14 03:46:43,624 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1559 transitions. Word has length 183 [2024-10-14 03:46:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:43,625 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1559 transitions. [2024-10-14 03:46:43,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1559 transitions. [2024-10-14 03:46:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 03:46:43,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:43,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:43,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:46:43,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -489321017, now seen corresponding path program 1 times [2024-10-14 03:46:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825339407] [2024-10-14 03:46:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:44,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825339407] [2024-10-14 03:46:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825339407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:44,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:44,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627688072] [2024-10-14 03:46:44,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:44,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:44,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:44,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:44,090 INFO L87 Difference]: Start difference. First operand 887 states and 1559 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:44,231 INFO L93 Difference]: Finished difference Result 1236 states and 2154 transitions. [2024-10-14 03:46:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2024-10-14 03:46:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:44,241 INFO L225 Difference]: With dead ends: 1236 [2024-10-14 03:46:44,243 INFO L226 Difference]: Without dead ends: 1046 [2024-10-14 03:46:44,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:44,249 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 300 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:44,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2742 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:46:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-10-14 03:46:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2024-10-14 03:46:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 1.7516778523489933) internal successors, (1827), 1043 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1827 transitions. [2024-10-14 03:46:44,315 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1827 transitions. Word has length 187 [2024-10-14 03:46:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:44,316 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1827 transitions. [2024-10-14 03:46:44,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1827 transitions. [2024-10-14 03:46:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 03:46:44,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:44,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:44,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:46:44,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash 667954872, now seen corresponding path program 1 times [2024-10-14 03:46:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131958845] [2024-10-14 03:46:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131958845] [2024-10-14 03:46:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131958845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:44,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850073236] [2024-10-14 03:46:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:44,600 INFO L87 Difference]: Start difference. First operand 1044 states and 1827 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:44,689 INFO L93 Difference]: Finished difference Result 2051 states and 3530 transitions. [2024-10-14 03:46:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2024-10-14 03:46:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:44,695 INFO L225 Difference]: With dead ends: 2051 [2024-10-14 03:46:44,695 INFO L226 Difference]: Without dead ends: 1531 [2024-10-14 03:46:44,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:44,697 INFO L432 NwaCegarLoop]: 1272 mSDtfsCounter, 292 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:44,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2507 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:46:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-14 03:46:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1529. [2024-10-14 03:46:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1528 states have (on average 1.7297120418848169) internal successors, (2643), 1528 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2643 transitions. [2024-10-14 03:46:44,728 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2643 transitions. Word has length 187 [2024-10-14 03:46:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:44,729 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2643 transitions. [2024-10-14 03:46:44,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2643 transitions. [2024-10-14 03:46:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-14 03:46:44,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:44,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:46:44,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1907588741, now seen corresponding path program 1 times [2024-10-14 03:46:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51238416] [2024-10-14 03:46:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51238416] [2024-10-14 03:46:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51238416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:45,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:45,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677443744] [2024-10-14 03:46:45,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:45,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:45,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:45,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:45,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:45,012 INFO L87 Difference]: Start difference. First operand 1529 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:45,058 INFO L93 Difference]: Finished difference Result 3473 states and 5915 transitions. [2024-10-14 03:46:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2024-10-14 03:46:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:45,066 INFO L225 Difference]: With dead ends: 3473 [2024-10-14 03:46:45,066 INFO L226 Difference]: Without dead ends: 2468 [2024-10-14 03:46:45,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:45,068 INFO L432 NwaCegarLoop]: 1436 mSDtfsCounter, 285 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:45,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2672 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2024-10-14 03:46:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2466. [2024-10-14 03:46:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 1.7075050709939148) internal successors, (4209), 2465 states have internal predecessors, (4209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4209 transitions. [2024-10-14 03:46:45,113 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4209 transitions. Word has length 191 [2024-10-14 03:46:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:45,113 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 4209 transitions. [2024-10-14 03:46:45,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4209 transitions. [2024-10-14 03:46:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 03:46:45,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:45,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:46:45,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1217924841, now seen corresponding path program 1 times [2024-10-14 03:46:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404571060] [2024-10-14 03:46:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404571060] [2024-10-14 03:46:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404571060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030517648] [2024-10-14 03:46:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:45,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:45,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:45,277 INFO L87 Difference]: Start difference. First operand 2466 states and 4209 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:45,324 INFO L93 Difference]: Finished difference Result 4336 states and 7366 transitions. [2024-10-14 03:46:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-10-14 03:46:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:45,333 INFO L225 Difference]: With dead ends: 4336 [2024-10-14 03:46:45,333 INFO L226 Difference]: Without dead ends: 3331 [2024-10-14 03:46:45,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:45,337 INFO L432 NwaCegarLoop]: 1428 mSDtfsCounter, 286 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:45,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2651 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2024-10-14 03:46:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3329. [2024-10-14 03:46:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3328 states have (on average 1.7001201923076923) internal successors, (5658), 3328 states have internal predecessors, (5658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5658 transitions. [2024-10-14 03:46:45,399 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5658 transitions. Word has length 195 [2024-10-14 03:46:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:45,400 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5658 transitions. [2024-10-14 03:46:45,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5658 transitions. [2024-10-14 03:46:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 03:46:45,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:45,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:45,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:46:45,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:45,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1018056424, now seen corresponding path program 1 times [2024-10-14 03:46:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015265906] [2024-10-14 03:46:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015265906] [2024-10-14 03:46:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015265906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:45,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:45,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564731365] [2024-10-14 03:46:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:45,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:45,668 INFO L87 Difference]: Start difference. First operand 3329 states and 5658 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:45,730 INFO L93 Difference]: Finished difference Result 8625 states and 14522 transitions. [2024-10-14 03:46:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-10-14 03:46:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:45,749 INFO L225 Difference]: With dead ends: 8625 [2024-10-14 03:46:45,749 INFO L226 Difference]: Without dead ends: 5878 [2024-10-14 03:46:45,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:45,756 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 278 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:45,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2638 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2024-10-14 03:46:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5876. [2024-10-14 03:46:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5875 states have (on average 1.6820425531914893) internal successors, (9882), 5875 states have internal predecessors, (9882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 9882 transitions. [2024-10-14 03:46:45,854 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 9882 transitions. Word has length 195 [2024-10-14 03:46:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 9882 transitions. [2024-10-14 03:46:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 9882 transitions. [2024-10-14 03:46:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 03:46:45,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:45,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:45,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:46:45,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1073706148, now seen corresponding path program 1 times [2024-10-14 03:46:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368719428] [2024-10-14 03:46:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368719428] [2024-10-14 03:46:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368719428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:46,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117684671] [2024-10-14 03:46:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:46,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:46,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:46,022 INFO L87 Difference]: Start difference. First operand 5876 states and 9882 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:46,086 INFO L93 Difference]: Finished difference Result 10822 states and 18188 transitions. [2024-10-14 03:46:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:46,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2024-10-14 03:46:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:46,109 INFO L225 Difference]: With dead ends: 10822 [2024-10-14 03:46:46,109 INFO L226 Difference]: Without dead ends: 8075 [2024-10-14 03:46:46,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:46,117 INFO L432 NwaCegarLoop]: 1392 mSDtfsCounter, 279 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:46,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 2616 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2024-10-14 03:46:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2024-10-14 03:46:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8072 states have (on average 1.6781466798810705) internal successors, (13546), 8072 states have internal predecessors, (13546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 13546 transitions. [2024-10-14 03:46:46,327 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 13546 transitions. Word has length 199 [2024-10-14 03:46:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:46,328 INFO L471 AbstractCegarLoop]: Abstraction has 8073 states and 13546 transitions. [2024-10-14 03:46:46,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 13546 transitions. [2024-10-14 03:46:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 03:46:46,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:46,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:46,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:46:46,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:46,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1024393755, now seen corresponding path program 1 times [2024-10-14 03:46:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:46,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910410841] [2024-10-14 03:46:46,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:46,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:46,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:46,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910410841] [2024-10-14 03:46:46,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910410841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:46,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413090580] [2024-10-14 03:46:46,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:46,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:46,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:46,489 INFO L87 Difference]: Start difference. First operand 8073 states and 13546 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:46,579 INFO L93 Difference]: Finished difference Result 22369 states and 37290 transitions. [2024-10-14 03:46:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2024-10-14 03:46:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:46,604 INFO L225 Difference]: With dead ends: 22369 [2024-10-14 03:46:46,604 INFO L226 Difference]: Without dead ends: 14924 [2024-10-14 03:46:46,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:46,618 INFO L432 NwaCegarLoop]: 1366 mSDtfsCounter, 271 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:46,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 2604 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14924 states. [2024-10-14 03:46:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14924 to 14922. [2024-10-14 03:46:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14922 states, 14921 states have (on average 1.6618189129414918) internal successors, (24796), 14921 states have internal predecessors, (24796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14922 states to 14922 states and 24796 transitions. [2024-10-14 03:46:46,942 INFO L78 Accepts]: Start accepts. Automaton has 14922 states and 24796 transitions. Word has length 199 [2024-10-14 03:46:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:46,943 INFO L471 AbstractCegarLoop]: Abstraction has 14922 states and 24796 transitions. [2024-10-14 03:46:46,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 14922 states and 24796 transitions. [2024-10-14 03:46:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 03:46:46,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:46,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:46,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:46:46,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:46,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1683879015, now seen corresponding path program 1 times [2024-10-14 03:46:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382974968] [2024-10-14 03:46:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382974968] [2024-10-14 03:46:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382974968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:47,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876748752] [2024-10-14 03:46:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:47,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:47,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:47,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:47,120 INFO L87 Difference]: Start difference. First operand 14922 states and 24796 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:47,244 INFO L93 Difference]: Finished difference Result 28076 states and 46722 transitions. [2024-10-14 03:46:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:47,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-10-14 03:46:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:47,281 INFO L225 Difference]: With dead ends: 28076 [2024-10-14 03:46:47,282 INFO L226 Difference]: Without dead ends: 20631 [2024-10-14 03:46:47,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:47,299 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 272 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:47,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2581 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20631 states. [2024-10-14 03:46:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20631 to 20629. [2024-10-14 03:46:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20629 states, 20628 states have (on average 1.6592010859026567) internal successors, (34226), 20628 states have internal predecessors, (34226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20629 states to 20629 states and 34226 transitions. [2024-10-14 03:46:47,612 INFO L78 Accepts]: Start accepts. Automaton has 20629 states and 34226 transitions. Word has length 203 [2024-10-14 03:46:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:47,613 INFO L471 AbstractCegarLoop]: Abstraction has 20629 states and 34226 transitions. [2024-10-14 03:46:47,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 20629 states and 34226 transitions. [2024-10-14 03:46:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 03:46:47,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:47,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:47,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:46:47,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:47,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1273865352, now seen corresponding path program 1 times [2024-10-14 03:46:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957042218] [2024-10-14 03:46:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957042218] [2024-10-14 03:46:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957042218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:48,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:48,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:46:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155234030] [2024-10-14 03:46:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:48,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:46:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:46:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:46:48,058 INFO L87 Difference]: Start difference. First operand 20629 states and 34226 transitions. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:48,939 INFO L93 Difference]: Finished difference Result 152826 states and 254673 transitions. [2024-10-14 03:46:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:46:48,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-10-14 03:46:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:49,402 INFO L225 Difference]: With dead ends: 152826 [2024-10-14 03:46:49,402 INFO L226 Difference]: Without dead ends: 132871 [2024-10-14 03:46:49,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:46:49,498 INFO L432 NwaCegarLoop]: 1257 mSDtfsCounter, 3735 mSDsluCounter, 9320 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3735 SdHoareTripleChecker+Valid, 10577 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3735 Valid, 10577 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:46:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132871 states. [2024-10-14 03:46:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132871 to 40287. [2024-10-14 03:46:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40287 states, 40286 states have (on average 1.6533286997964554) internal successors, (66606), 40286 states have internal predecessors, (66606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40287 states to 40287 states and 66606 transitions. [2024-10-14 03:46:50,931 INFO L78 Accepts]: Start accepts. Automaton has 40287 states and 66606 transitions. Word has length 203 [2024-10-14 03:46:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:50,932 INFO L471 AbstractCegarLoop]: Abstraction has 40287 states and 66606 transitions. [2024-10-14 03:46:50,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40287 states and 66606 transitions. [2024-10-14 03:46:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 03:46:50,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:50,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:46:50,935 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -906740057, now seen corresponding path program 1 times [2024-10-14 03:46:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871085795] [2024-10-14 03:46:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871085795] [2024-10-14 03:46:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871085795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:46:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496876274] [2024-10-14 03:46:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:51,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:46:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:46:51,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:46:51,347 INFO L87 Difference]: Start difference. First operand 40287 states and 66606 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:51,804 INFO L93 Difference]: Finished difference Result 132050 states and 219051 transitions. [2024-10-14 03:46:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:46:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-10-14 03:46:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:52,291 INFO L225 Difference]: With dead ends: 132050 [2024-10-14 03:46:52,291 INFO L226 Difference]: Without dead ends: 92485 [2024-10-14 03:46:52,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:46:52,350 INFO L432 NwaCegarLoop]: 1254 mSDtfsCounter, 939 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:52,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 4043 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:46:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92485 states. [2024-10-14 03:46:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92485 to 66277. [2024-10-14 03:46:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66277 states, 66276 states have (on average 1.653901864928481) internal successors, (109614), 66276 states have internal predecessors, (109614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66277 states to 66277 states and 109614 transitions. [2024-10-14 03:46:53,634 INFO L78 Accepts]: Start accepts. Automaton has 66277 states and 109614 transitions. Word has length 204 [2024-10-14 03:46:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:53,636 INFO L471 AbstractCegarLoop]: Abstraction has 66277 states and 109614 transitions. [2024-10-14 03:46:53,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 66277 states and 109614 transitions. [2024-10-14 03:46:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 03:46:53,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:53,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:46:53,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2013046930, now seen corresponding path program 1 times [2024-10-14 03:46:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267066176] [2024-10-14 03:46:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:53,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267066176] [2024-10-14 03:46:53,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267066176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:53,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:53,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:46:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936255977] [2024-10-14 03:46:53,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:53,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:46:53,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:46:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:53,802 INFO L87 Difference]: Start difference. First operand 66277 states and 109614 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:54,124 INFO L93 Difference]: Finished difference Result 126275 states and 209408 transitions. [2024-10-14 03:46:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:46:54,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-10-14 03:46:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:54,636 INFO L225 Difference]: With dead ends: 126275 [2024-10-14 03:46:54,637 INFO L226 Difference]: Without dead ends: 91715 [2024-10-14 03:46:54,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:46:54,676 INFO L432 NwaCegarLoop]: 1494 mSDtfsCounter, 293 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:54,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2716 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:46:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91715 states. [2024-10-14 03:46:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91715 to 91713. [2024-10-14 03:46:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91713 states, 91712 states have (on average 1.65207388346127) internal successors, (151515), 91712 states have internal predecessors, (151515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91713 states to 91713 states and 151515 transitions. [2024-10-14 03:46:55,914 INFO L78 Accepts]: Start accepts. Automaton has 91713 states and 151515 transitions. Word has length 204 [2024-10-14 03:46:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:46:55,923 INFO L471 AbstractCegarLoop]: Abstraction has 91713 states and 151515 transitions. [2024-10-14 03:46:55,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 91713 states and 151515 transitions. [2024-10-14 03:46:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 03:46:55,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:46:55,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:46:55,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:46:55,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:46:55,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:46:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1888767519, now seen corresponding path program 1 times [2024-10-14 03:46:55,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:46:55,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584283931] [2024-10-14 03:46:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:46:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:46:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:46:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:46:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:46:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584283931] [2024-10-14 03:46:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584283931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:46:56,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:46:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:46:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594556240] [2024-10-14 03:46:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:46:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:46:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:46:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:46:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:46:56,635 INFO L87 Difference]: Start difference. First operand 91713 states and 151515 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:46:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:46:57,643 INFO L93 Difference]: Finished difference Result 301344 states and 498638 transitions. [2024-10-14 03:46:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:46:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2024-10-14 03:46:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:46:58,409 INFO L225 Difference]: With dead ends: 301344 [2024-10-14 03:46:58,410 INFO L226 Difference]: Without dead ends: 210247 [2024-10-14 03:46:58,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:46:58,456 INFO L432 NwaCegarLoop]: 1254 mSDtfsCounter, 937 mSDsluCounter, 2791 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:46:58,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 4045 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:46:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210247 states. [2024-10-14 03:47:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210247 to 150711. [2024-10-14 03:47:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150711 states, 150710 states have (on average 1.6490279344436334) internal successors, (248525), 150710 states have internal predecessors, (248525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150711 states to 150711 states and 248525 transitions. [2024-10-14 03:47:00,714 INFO L78 Accepts]: Start accepts. Automaton has 150711 states and 248525 transitions. Word has length 205 [2024-10-14 03:47:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:47:00,714 INFO L471 AbstractCegarLoop]: Abstraction has 150711 states and 248525 transitions. [2024-10-14 03:47:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 150711 states and 248525 transitions. [2024-10-14 03:47:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 03:47:00,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:47:00,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:47:00,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:47:00,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:47:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:47:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1640252818, now seen corresponding path program 1 times [2024-10-14 03:47:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:47:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486667061] [2024-10-14 03:47:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:47:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:47:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:47:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:47:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:47:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486667061] [2024-10-14 03:47:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486667061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:47:01,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:47:01,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:47:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636694930] [2024-10-14 03:47:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:47:01,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:47:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:47:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:47:01,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:47:01,083 INFO L87 Difference]: Start difference. First operand 150711 states and 248525 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:47:03,086 INFO L93 Difference]: Finished difference Result 494880 states and 817502 transitions. [2024-10-14 03:47:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:47:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-10-14 03:47:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:47:03,756 INFO L225 Difference]: With dead ends: 494880 [2024-10-14 03:47:03,757 INFO L226 Difference]: Without dead ends: 344785 [2024-10-14 03:47:03,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:47:03,945 INFO L432 NwaCegarLoop]: 1254 mSDtfsCounter, 935 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:47:03,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4047 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:47:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344785 states. [2024-10-14 03:47:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344785 to 247305. [2024-10-14 03:47:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247305 states, 247304 states have (on average 1.646099537411445) internal successors, (407087), 247304 states have internal predecessors, (407087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247305 states to 247305 states and 407087 transitions. [2024-10-14 03:47:09,113 INFO L78 Accepts]: Start accepts. Automaton has 247305 states and 407087 transitions. Word has length 206 [2024-10-14 03:47:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:47:09,114 INFO L471 AbstractCegarLoop]: Abstraction has 247305 states and 407087 transitions. [2024-10-14 03:47:09,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 247305 states and 407087 transitions. [2024-10-14 03:47:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 03:47:09,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:47:09,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:47:09,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:47:09,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:47:09,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:47:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 633824454, now seen corresponding path program 1 times [2024-10-14 03:47:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:47:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251149171] [2024-10-14 03:47:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:47:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:47:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:47:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:47:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:47:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251149171] [2024-10-14 03:47:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251149171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:47:09,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:47:09,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:47:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295955840] [2024-10-14 03:47:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:47:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:47:09,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:47:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:47:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:47:09,464 INFO L87 Difference]: Start difference. First operand 247305 states and 407087 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:47:13,306 INFO L93 Difference]: Finished difference Result 809440 states and 1334902 transitions. [2024-10-14 03:47:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:47:13,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2024-10-14 03:47:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:47:14,553 INFO L225 Difference]: With dead ends: 809440 [2024-10-14 03:47:14,554 INFO L226 Difference]: Without dead ends: 562751 [2024-10-14 03:47:14,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:47:14,804 INFO L432 NwaCegarLoop]: 1260 mSDtfsCounter, 933 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:47:14,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 3980 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:47:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562751 states. [2024-10-14 03:47:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562751 to 404303. [2024-10-14 03:47:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404303 states, 404302 states have (on average 1.6432691403950512) internal successors, (664377), 404302 states have internal predecessors, (664377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404303 states to 404303 states and 664377 transitions. [2024-10-14 03:47:23,732 INFO L78 Accepts]: Start accepts. Automaton has 404303 states and 664377 transitions. Word has length 207 [2024-10-14 03:47:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:47:23,732 INFO L471 AbstractCegarLoop]: Abstraction has 404303 states and 664377 transitions. [2024-10-14 03:47:23,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 404303 states and 664377 transitions. [2024-10-14 03:47:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 03:47:23,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:47:23,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:47:23,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:47:23,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:47:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:47:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1879666123, now seen corresponding path program 1 times [2024-10-14 03:47:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:47:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775940957] [2024-10-14 03:47:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:47:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:47:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:47:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:47:23,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:47:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775940957] [2024-10-14 03:47:23,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775940957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:47:23,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:47:23,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:47:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022196849] [2024-10-14 03:47:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:47:23,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:47:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:47:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:47:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:47:23,904 INFO L87 Difference]: Start difference. First operand 404303 states and 664377 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:47:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:47:29,914 INFO L93 Difference]: Finished difference Result 1314016 states and 2163446 transitions. [2024-10-14 03:47:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:47:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-10-14 03:47:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted.