./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/pals_floodmax.4.ufo.UNBOUNDED.pals.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/pals_floodmax.4.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62204da2eab9fabc07e0a3780bac6c183714a9a5b9e2b6bd6a8ef0836349aca5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:28:48,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:28:48,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:28:48,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:28:48,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:28:48,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:28:48,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:28:48,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:28:48,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:28:48,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:28:48,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:28:48,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:28:48,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:28:48,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:28:48,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:28:48,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:28:48,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:28:48,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:28:48,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:28:48,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:28:48,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:28:48,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:28:48,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:28:48,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:28:48,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:28:48,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:28:48,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:28:48,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:28:48,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:28:48,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:28:48,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:28:48,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:28:48,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:28:48,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:28:48,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:28:48,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:28:48,190 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 -> 62204da2eab9fabc07e0a3780bac6c183714a9a5b9e2b6bd6a8ef0836349aca5 [2024-10-14 03:28:48,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:28:48,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:28:48,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:28:48,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:28:48,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:28:48,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.UNBOUNDED.pals.c [2024-10-14 03:28:49,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:28:49,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:28:49,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.UNBOUNDED.pals.c [2024-10-14 03:28:49,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9bf7a77/3edb4a2fdc3c48a09d709a8f224f8c5a/FLAGd88068375 [2024-10-14 03:28:49,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9bf7a77/3edb4a2fdc3c48a09d709a8f224f8c5a [2024-10-14 03:28:49,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:28:49,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:28:50,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:28:50,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:28:50,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:28:50,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:28:49" (1/1) ... [2024-10-14 03:28:50,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40870e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50, skipping insertion in model container [2024-10-14 03:28:50,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:28:49" (1/1) ... [2024-10-14 03:28:50,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:28:50,278 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/pals_floodmax.4.ufo.UNBOUNDED.pals.c[28366,28379] [2024-10-14 03:28:50,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:28:50,293 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:28:50,345 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/pals_floodmax.4.ufo.UNBOUNDED.pals.c[28366,28379] [2024-10-14 03:28:50,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:28:50,360 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:28:50,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50 WrapperNode [2024-10-14 03:28:50,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:28:50,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:28:50,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:28:50,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:28:50,366 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:28:50" (1/1) ... [2024-10-14 03:28:50,378 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:28:50" (1/1) ... [2024-10-14 03:28:50,419 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 959 [2024-10-14 03:28:50,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:28:50,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:28:50,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:28:50,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:28:50,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,455 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:28:50,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:28:50,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:28:50,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:28:50,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:28:50,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (1/1) ... [2024-10-14 03:28:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:28:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:28:50,547 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:28:50,552 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:28:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:28:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:28:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:28:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:28:50,735 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:28:50,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:28:51,531 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-14 03:28:51,531 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:28:51,591 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:28:51,592 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:28:51,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:28:51 BoogieIcfgContainer [2024-10-14 03:28:51,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:28:51,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:28:51,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:28:51,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:28:51,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:28:49" (1/3) ... [2024-10-14 03:28:51,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1e78f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:28:51, skipping insertion in model container [2024-10-14 03:28:51,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:50" (2/3) ... [2024-10-14 03:28:51,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1e78f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:28:51, skipping insertion in model container [2024-10-14 03:28:51,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:28:51" (3/3) ... [2024-10-14 03:28:51,601 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c [2024-10-14 03:28:51,616 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:28:51,616 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:28:51,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:28:51,692 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;@4562a757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:28:51,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:28:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.8398576512455516) internal successors, (517), 282 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:28:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:28:51,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:51,715 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] [2024-10-14 03:28:51,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1778473613, now seen corresponding path program 1 times [2024-10-14 03:28:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979333400] [2024-10-14 03:28:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:52,059 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:28:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979333400] [2024-10-14 03:28:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979333400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:28:52,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891381875] [2024-10-14 03:28:52,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:52,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:28:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:52,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:28:52,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:28:52,092 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.8398576512455516) internal successors, (517), 282 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:28:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:52,161 INFO L93 Difference]: Finished difference Result 375 states and 681 transitions. [2024-10-14 03:28:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:28:52,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-14 03:28:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:52,174 INFO L225 Difference]: With dead ends: 375 [2024-10-14 03:28:52,176 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 03:28:52,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:28:52,183 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:52,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 03:28:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-14 03:28:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.8285714285714285) internal successors, (512), 280 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:28:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 512 transitions. [2024-10-14 03:28:52,227 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 512 transitions. Word has length 74 [2024-10-14 03:28:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:52,227 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 512 transitions. [2024-10-14 03:28:52,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:28:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 512 transitions. [2024-10-14 03:28:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:28:52,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:52,230 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] [2024-10-14 03:28:52,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:28:52,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:52,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 711055349, now seen corresponding path program 1 times [2024-10-14 03:28:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389826711] [2024-10-14 03:28:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:52,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:52,517 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:28:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389826711] [2024-10-14 03:28:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389826711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:52,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:52,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:52,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337343769] [2024-10-14 03:28:52,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:52,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:52,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:52,522 INFO L87 Difference]: Start difference. First operand 281 states and 512 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:28:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:52,636 INFO L93 Difference]: Finished difference Result 375 states and 675 transitions. [2024-10-14 03:28:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-14 03:28:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:52,638 INFO L225 Difference]: With dead ends: 375 [2024-10-14 03:28:52,640 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 03:28:52,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:52,642 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:52,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1482 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 03:28:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-14 03:28:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.6785714285714286) internal successors, (470), 280 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:28:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 470 transitions. [2024-10-14 03:28:52,660 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 470 transitions. Word has length 74 [2024-10-14 03:28:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:52,660 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 470 transitions. [2024-10-14 03:28:52,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:28:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 470 transitions. [2024-10-14 03:28:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:28:52,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:52,666 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] [2024-10-14 03:28:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:28:52,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:52,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 648159621, now seen corresponding path program 1 times [2024-10-14 03:28:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526729508] [2024-10-14 03:28:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:52,902 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:28:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526729508] [2024-10-14 03:28:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526729508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:52,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092154635] [2024-10-14 03:28:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:52,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:52,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:52,905 INFO L87 Difference]: Start difference. First operand 281 states and 470 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:28:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:52,974 INFO L93 Difference]: Finished difference Result 452 states and 769 transitions. [2024-10-14 03:28:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-14 03:28:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:52,978 INFO L225 Difference]: With dead ends: 452 [2024-10-14 03:28:52,978 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 03:28:52,979 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:28:52,980 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 130 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:52,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 879 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 03:28:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2024-10-14 03:28:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.6834733893557423) internal successors, (601), 357 states have internal predecessors, (601), 0 states have call successors, (0), 0 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:28:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 601 transitions. [2024-10-14 03:28:52,991 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 601 transitions. Word has length 115 [2024-10-14 03:28:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:52,991 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 601 transitions. [2024-10-14 03:28:52,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:28:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 601 transitions. [2024-10-14 03:28:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:28:52,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:52,993 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] [2024-10-14 03:28:52,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:28:52,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1536040655, now seen corresponding path program 1 times [2024-10-14 03:28:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573573684] [2024-10-14 03:28:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:53,155 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:28:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573573684] [2024-10-14 03:28:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573573684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:53,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:53,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417241745] [2024-10-14 03:28:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:53,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:53,159 INFO L87 Difference]: Start difference. First operand 358 states and 601 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:28:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:53,196 INFO L93 Difference]: Finished difference Result 676 states and 1149 transitions. [2024-10-14 03:28:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-14 03:28:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:53,199 INFO L225 Difference]: With dead ends: 676 [2024-10-14 03:28:53,199 INFO L226 Difference]: Without dead ends: 508 [2024-10-14 03:28:53,200 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:28:53,203 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 131 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:53,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 891 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-14 03:28:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2024-10-14 03:28:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.6918489065606361) internal successors, (851), 503 states have internal predecessors, (851), 0 states have call successors, (0), 0 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:28:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 851 transitions. [2024-10-14 03:28:53,221 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 851 transitions. Word has length 118 [2024-10-14 03:28:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:53,222 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 851 transitions. [2024-10-14 03:28:53,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:28:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 851 transitions. [2024-10-14 03:28:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 03:28:53,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:53,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:28:53,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1145213002, now seen corresponding path program 1 times [2024-10-14 03:28:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757429153] [2024-10-14 03:28:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:53,379 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:28:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757429153] [2024-10-14 03:28:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757429153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:53,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089366279] [2024-10-14 03:28:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:53,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:53,384 INFO L87 Difference]: Start difference. First operand 504 states and 851 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:53,424 INFO L93 Difference]: Finished difference Result 1096 states and 1865 transitions. [2024-10-14 03:28:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-10-14 03:28:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:53,428 INFO L225 Difference]: With dead ends: 1096 [2024-10-14 03:28:53,429 INFO L226 Difference]: Without dead ends: 782 [2024-10-14 03:28:53,431 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:28:53,432 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 124 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:53,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 892 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-14 03:28:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 776. [2024-10-14 03:28:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.6916129032258065) internal successors, (1311), 775 states have internal predecessors, (1311), 0 states have call successors, (0), 0 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:28:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1311 transitions. [2024-10-14 03:28:53,459 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1311 transitions. Word has length 121 [2024-10-14 03:28:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:53,459 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1311 transitions. [2024-10-14 03:28:53,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1311 transitions. [2024-10-14 03:28:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 03:28:53,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:53,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:53,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:28:53,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:53,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1127178636, now seen corresponding path program 1 times [2024-10-14 03:28:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:53,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046945859] [2024-10-14 03:28:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:53,645 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:28:53,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046945859] [2024-10-14 03:28:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046945859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:53,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:53,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830862315] [2024-10-14 03:28:53,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:53,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:53,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:53,647 INFO L87 Difference]: Start difference. First operand 776 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:53,693 INFO L93 Difference]: Finished difference Result 1876 states and 3177 transitions. [2024-10-14 03:28:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-14 03:28:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:53,700 INFO L225 Difference]: With dead ends: 1876 [2024-10-14 03:28:53,701 INFO L226 Difference]: Without dead ends: 1290 [2024-10-14 03:28:53,702 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:28:53,702 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 117 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:53,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 893 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-10-14 03:28:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1280. [2024-10-14 03:28:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.6817826426896012) internal successors, (2151), 1279 states have internal predecessors, (2151), 0 states have call successors, (0), 0 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:28:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2151 transitions. [2024-10-14 03:28:53,745 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2151 transitions. Word has length 124 [2024-10-14 03:28:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:53,745 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2151 transitions. [2024-10-14 03:28:53,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2151 transitions. [2024-10-14 03:28:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 03:28:53,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:53,747 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] [2024-10-14 03:28:53,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:28:53,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:53,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1287551471, now seen corresponding path program 1 times [2024-10-14 03:28:53,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:53,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381629645] [2024-10-14 03:28:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:53,975 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:28:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381629645] [2024-10-14 03:28:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381629645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:53,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:28:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455168282] [2024-10-14 03:28:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:53,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:28:53,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:28:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:28:53,979 INFO L87 Difference]: Start difference. First operand 1280 states and 2151 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:28:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:54,259 INFO L93 Difference]: Finished difference Result 6440 states and 11003 transitions. [2024-10-14 03:28:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:28:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-10-14 03:28:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:54,277 INFO L225 Difference]: With dead ends: 6440 [2024-10-14 03:28:54,277 INFO L226 Difference]: Without dead ends: 5350 [2024-10-14 03:28:54,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:28:54,280 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 1575 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:54,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 3486 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:28:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5350 states. [2024-10-14 03:28:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5350 to 2293. [2024-10-14 03:28:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2292 states have (on average 1.6845549738219896) internal successors, (3861), 2292 states have internal predecessors, (3861), 0 states have call successors, (0), 0 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:28:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3861 transitions. [2024-10-14 03:28:54,344 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3861 transitions. Word has length 127 [2024-10-14 03:28:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:54,345 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 3861 transitions. [2024-10-14 03:28:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:28:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3861 transitions. [2024-10-14 03:28:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 03:28:54,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:54,347 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] [2024-10-14 03:28:54,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:28:54,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:54,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1327593618, now seen corresponding path program 1 times [2024-10-14 03:28:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:54,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141086442] [2024-10-14 03:28:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:54,479 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:28:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141086442] [2024-10-14 03:28:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141086442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947630125] [2024-10-14 03:28:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:54,481 INFO L87 Difference]: Start difference. First operand 2293 states and 3861 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:28:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:54,590 INFO L93 Difference]: Finished difference Result 6650 states and 11312 transitions. [2024-10-14 03:28:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-10-14 03:28:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:54,609 INFO L225 Difference]: With dead ends: 6650 [2024-10-14 03:28:54,609 INFO L226 Difference]: Without dead ends: 4547 [2024-10-14 03:28:54,614 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:28:54,615 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 453 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:54,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1499 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2024-10-14 03:28:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 3403. [2024-10-14 03:28:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3402 states have (on average 1.6901822457378013) internal successors, (5750), 3402 states have internal predecessors, (5750), 0 states have call successors, (0), 0 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:28:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 5750 transitions. [2024-10-14 03:28:54,697 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 5750 transitions. Word has length 128 [2024-10-14 03:28:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:54,697 INFO L471 AbstractCegarLoop]: Abstraction has 3403 states and 5750 transitions. [2024-10-14 03:28:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:28:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 5750 transitions. [2024-10-14 03:28:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 03:28:54,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:54,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:54,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:28:54,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1731518874, now seen corresponding path program 1 times [2024-10-14 03:28:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836133186] [2024-10-14 03:28:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:54,857 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:28:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836133186] [2024-10-14 03:28:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836133186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:54,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500959025] [2024-10-14 03:28:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:54,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:54,860 INFO L87 Difference]: Start difference. First operand 3403 states and 5750 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:54,990 INFO L93 Difference]: Finished difference Result 9930 states and 16870 transitions. [2024-10-14 03:28:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:54,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-10-14 03:28:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:55,012 INFO L225 Difference]: With dead ends: 9930 [2024-10-14 03:28:55,013 INFO L226 Difference]: Without dead ends: 6717 [2024-10-14 03:28:55,020 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:28:55,021 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 453 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:55,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1412 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2024-10-14 03:28:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 5036. [2024-10-14 03:28:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5036 states, 5035 states have (on average 1.6883813306852036) internal successors, (8501), 5035 states have internal predecessors, (8501), 0 states have call successors, (0), 0 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:28:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 8501 transitions. [2024-10-14 03:28:55,179 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 8501 transitions. Word has length 129 [2024-10-14 03:28:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:55,180 INFO L471 AbstractCegarLoop]: Abstraction has 5036 states and 8501 transitions. [2024-10-14 03:28:55,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 8501 transitions. [2024-10-14 03:28:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:28:55,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:55,183 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] [2024-10-14 03:28:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:28:55,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1954850968, now seen corresponding path program 1 times [2024-10-14 03:28:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:55,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114437319] [2024-10-14 03:28:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:55,278 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:28:55,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:55,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114437319] [2024-10-14 03:28:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114437319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:55,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388570067] [2024-10-14 03:28:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:55,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:55,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:55,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:55,280 INFO L87 Difference]: Start difference. First operand 5036 states and 8501 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:55,373 INFO L93 Difference]: Finished difference Result 11263 states and 19137 transitions. [2024-10-14 03:28:55,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:55,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-14 03:28:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:55,451 INFO L225 Difference]: With dead ends: 11263 [2024-10-14 03:28:55,451 INFO L226 Difference]: Without dead ends: 7793 [2024-10-14 03:28:55,456 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:28:55,456 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 137 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:55,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1033 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7793 states. [2024-10-14 03:28:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7793 to 7791. [2024-10-14 03:28:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7791 states, 7790 states have (on average 1.6851091142490373) internal successors, (13127), 7790 states have internal predecessors, (13127), 0 states have call successors, (0), 0 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:28:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 13127 transitions. [2024-10-14 03:28:55,652 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 13127 transitions. Word has length 130 [2024-10-14 03:28:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:55,653 INFO L471 AbstractCegarLoop]: Abstraction has 7791 states and 13127 transitions. [2024-10-14 03:28:55,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 13127 transitions. [2024-10-14 03:28:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:28:55,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:55,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:28:55,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2080177367, now seen corresponding path program 1 times [2024-10-14 03:28:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885010816] [2024-10-14 03:28:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:55,781 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:28:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:55,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885010816] [2024-10-14 03:28:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885010816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:55,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747957437] [2024-10-14 03:28:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:55,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:55,783 INFO L87 Difference]: Start difference. First operand 7791 states and 13127 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:56,053 INFO L93 Difference]: Finished difference Result 23156 states and 39212 transitions. [2024-10-14 03:28:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-14 03:28:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:56,086 INFO L225 Difference]: With dead ends: 23156 [2024-10-14 03:28:56,086 INFO L226 Difference]: Without dead ends: 15557 [2024-10-14 03:28:56,098 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:28:56,099 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 451 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:56,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1506 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15557 states. [2024-10-14 03:28:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15557 to 11618. [2024-10-14 03:28:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11618 states, 11617 states have (on average 1.6824481363518982) internal successors, (19545), 11617 states have internal predecessors, (19545), 0 states have call successors, (0), 0 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:28:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11618 states to 11618 states and 19545 transitions. [2024-10-14 03:28:56,425 INFO L78 Accepts]: Start accepts. Automaton has 11618 states and 19545 transitions. Word has length 130 [2024-10-14 03:28:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:56,426 INFO L471 AbstractCegarLoop]: Abstraction has 11618 states and 19545 transitions. [2024-10-14 03:28:56,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 11618 states and 19545 transitions. [2024-10-14 03:28:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:28:56,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:56,428 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] [2024-10-14 03:28:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:28:56,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:56,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1116412873, now seen corresponding path program 1 times [2024-10-14 03:28:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848499716] [2024-10-14 03:28:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:56,518 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:28:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848499716] [2024-10-14 03:28:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848499716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:56,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298034850] [2024-10-14 03:28:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:56,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:56,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:56,520 INFO L87 Difference]: Start difference. First operand 11618 states and 19545 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:56,742 INFO L93 Difference]: Finished difference Result 23335 states and 39299 transitions. [2024-10-14 03:28:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:56,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-14 03:28:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:56,770 INFO L225 Difference]: With dead ends: 23335 [2024-10-14 03:28:56,770 INFO L226 Difference]: Without dead ends: 16815 [2024-10-14 03:28:56,776 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:28:56,776 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 116 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:56,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 975 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16815 states. [2024-10-14 03:28:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16815 to 16813. [2024-10-14 03:28:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16813 states, 16812 states have (on average 1.671960504401618) internal successors, (28109), 16812 states have internal predecessors, (28109), 0 states have call successors, (0), 0 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:28:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16813 states to 16813 states and 28109 transitions. [2024-10-14 03:28:57,146 INFO L78 Accepts]: Start accepts. Automaton has 16813 states and 28109 transitions. Word has length 130 [2024-10-14 03:28:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:57,147 INFO L471 AbstractCegarLoop]: Abstraction has 16813 states and 28109 transitions. [2024-10-14 03:28:57,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 16813 states and 28109 transitions. [2024-10-14 03:28:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:28:57,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:57,149 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] [2024-10-14 03:28:57,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:28:57,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash 354488248, now seen corresponding path program 1 times [2024-10-14 03:28:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965943018] [2024-10-14 03:28:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:57,247 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:28:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965943018] [2024-10-14 03:28:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965943018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778571270] [2024-10-14 03:28:57,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:57,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:57,250 INFO L87 Difference]: Start difference. First operand 16813 states and 28109 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:57,541 INFO L93 Difference]: Finished difference Result 37415 states and 62637 transitions. [2024-10-14 03:28:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-14 03:28:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:57,588 INFO L225 Difference]: With dead ends: 37415 [2024-10-14 03:28:57,589 INFO L226 Difference]: Without dead ends: 25694 [2024-10-14 03:28:57,613 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:28:57,614 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 123 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:57,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1003 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25694 states. [2024-10-14 03:28:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25694 to 25692. [2024-10-14 03:28:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25692 states, 25691 states have (on average 1.6602312093729321) internal successors, (42653), 25691 states have internal predecessors, (42653), 0 states have call successors, (0), 0 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:28:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25692 states to 25692 states and 42653 transitions. [2024-10-14 03:28:58,291 INFO L78 Accepts]: Start accepts. Automaton has 25692 states and 42653 transitions. Word has length 130 [2024-10-14 03:28:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:58,292 INFO L471 AbstractCegarLoop]: Abstraction has 25692 states and 42653 transitions. [2024-10-14 03:28:58,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 25692 states and 42653 transitions. [2024-10-14 03:28:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 03:28:58,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:58,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:58,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:28:58,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:58,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1808950617, now seen corresponding path program 1 times [2024-10-14 03:28:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041893246] [2024-10-14 03:28:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:58,369 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:28:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041893246] [2024-10-14 03:28:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041893246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:58,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200003741] [2024-10-14 03:28:58,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:58,371 INFO L87 Difference]: Start difference. First operand 25692 states and 42653 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:58,820 INFO L93 Difference]: Finished difference Result 57237 states and 95088 transitions. [2024-10-14 03:28:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-14 03:28:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:58,990 INFO L225 Difference]: With dead ends: 57237 [2024-10-14 03:28:58,990 INFO L226 Difference]: Without dead ends: 39167 [2024-10-14 03:28:59,020 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:28:59,021 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 130 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:59,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1032 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39167 states. [2024-10-14 03:28:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39167 to 39165. [2024-10-14 03:28:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39165 states, 39164 states have (on average 1.6454396895107752) internal successors, (64442), 39164 states have internal predecessors, (64442), 0 states have call successors, (0), 0 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:28:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39165 states to 39165 states and 64442 transitions. [2024-10-14 03:28:59,816 INFO L78 Accepts]: Start accepts. Automaton has 39165 states and 64442 transitions. Word has length 130 [2024-10-14 03:28:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:59,816 INFO L471 AbstractCegarLoop]: Abstraction has 39165 states and 64442 transitions. [2024-10-14 03:28:59,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:28:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 39165 states and 64442 transitions. [2024-10-14 03:28:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 03:28:59,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:59,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:28:59,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:59,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 9140515, now seen corresponding path program 1 times [2024-10-14 03:28:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656610257] [2024-10-14 03:28:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:29:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:29:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:29:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656610257] [2024-10-14 03:29:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656610257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:29:00,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:29:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:29:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918301954] [2024-10-14 03:29:00,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:29:00,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:29:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:29:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:29:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:29:00,092 INFO L87 Difference]: Start difference. First operand 39165 states and 64442 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:29:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:29:01,035 INFO L93 Difference]: Finished difference Result 126905 states and 209400 transitions. [2024-10-14 03:29:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:29:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-10-14 03:29:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:29:01,246 INFO L225 Difference]: With dead ends: 126905 [2024-10-14 03:29:01,246 INFO L226 Difference]: Without dead ends: 87953 [2024-10-14 03:29:01,299 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:29:01,300 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 449 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:29:01,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1493 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:29:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87953 states. [2024-10-14 03:29:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87953 to 63334. [2024-10-14 03:29:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63334 states, 63333 states have (on average 1.638245464449813) internal successors, (103755), 63333 states have internal predecessors, (103755), 0 states have call successors, (0), 0 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:29:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63334 states to 63334 states and 103755 transitions. [2024-10-14 03:29:02,876 INFO L78 Accepts]: Start accepts. Automaton has 63334 states and 103755 transitions. Word has length 131 [2024-10-14 03:29:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:29:02,876 INFO L471 AbstractCegarLoop]: Abstraction has 63334 states and 103755 transitions. [2024-10-14 03:29:02,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:29:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 63334 states and 103755 transitions. [2024-10-14 03:29:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 03:29:02,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:29:02,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:29:02,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:29:02,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:29:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:29:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1283204917, now seen corresponding path program 1 times [2024-10-14 03:29:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:29:02,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152226389] [2024-10-14 03:29:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:29:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:29:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:29:03,178 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:29:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:29:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152226389] [2024-10-14 03:29:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152226389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:29:03,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:29:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:29:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036242140] [2024-10-14 03:29:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:29:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:29:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:29:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:29:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:29:03,180 INFO L87 Difference]: Start difference. First operand 63334 states and 103755 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:29:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:29:04,353 INFO L93 Difference]: Finished difference Result 126457 states and 207169 transitions. [2024-10-14 03:29:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:29:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-14 03:29:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:29:04,472 INFO L225 Difference]: With dead ends: 126457 [2024-10-14 03:29:04,472 INFO L226 Difference]: Without dead ends: 63336 [2024-10-14 03:29:04,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:29:04,523 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 239 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:29:04,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1769 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:29:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63336 states. [2024-10-14 03:29:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63336 to 63334. [2024-10-14 03:29:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63334 states, 63333 states have (on average 1.6283769914578499) internal successors, (103130), 63333 states have internal predecessors, (103130), 0 states have call successors, (0), 0 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:29:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63334 states to 63334 states and 103130 transitions. [2024-10-14 03:29:05,646 INFO L78 Accepts]: Start accepts. Automaton has 63334 states and 103130 transitions. Word has length 133 [2024-10-14 03:29:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:29:05,646 INFO L471 AbstractCegarLoop]: Abstraction has 63334 states and 103130 transitions. [2024-10-14 03:29:05,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:29:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 63334 states and 103130 transitions. [2024-10-14 03:29:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 03:29:05,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:29:05,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:29:05,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:29:05,648 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:29:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:29:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 49875956, now seen corresponding path program 1 times [2024-10-14 03:29:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:29:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202821095] [2024-10-14 03:29:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:29:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:29:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:29:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:29:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:29:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202821095] [2024-10-14 03:29:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202821095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:29:06,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:29:06,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:29:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921180106] [2024-10-14 03:29:06,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:29:06,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:29:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:29:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:29:06,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:29:06,141 INFO L87 Difference]: Start difference. First operand 63334 states and 103130 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:29:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:29:07,606 INFO L93 Difference]: Finished difference Result 185239 states and 302101 transitions. [2024-10-14 03:29:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:29:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-10-14 03:29:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:29:07,796 INFO L225 Difference]: With dead ends: 185239 [2024-10-14 03:29:07,797 INFO L226 Difference]: Without dead ends: 122118 [2024-10-14 03:29:07,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:29:07,845 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 119 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:29:07,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2219 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:29:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122118 states. [2024-10-14 03:29:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122118 to 122116. [2024-10-14 03:29:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122116 states, 122115 states have (on average 1.6156491831470334) internal successors, (197295), 122115 states have internal predecessors, (197295), 0 states have call successors, (0), 0 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:29:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122116 states to 122116 states and 197295 transitions. [2024-10-14 03:29:10,333 INFO L78 Accepts]: Start accepts. Automaton has 122116 states and 197295 transitions. Word has length 136 [2024-10-14 03:29:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:29:10,333 INFO L471 AbstractCegarLoop]: Abstraction has 122116 states and 197295 transitions. [2024-10-14 03:29:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:29:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 122116 states and 197295 transitions. [2024-10-14 03:29:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 03:29:10,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:29:10,335 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] [2024-10-14 03:29:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:29:10,335 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:29:10,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:29:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1531604546, now seen corresponding path program 1 times [2024-10-14 03:29:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:29:10,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964378014] [2024-10-14 03:29:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:29:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:29:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:29:10,632 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:29:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:29:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964378014] [2024-10-14 03:29:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964378014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:29:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:29:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:29:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541311805] [2024-10-14 03:29:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:29:10,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:29:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:29:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:29:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:29:10,634 INFO L87 Difference]: Start difference. First operand 122116 states and 197295 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:29:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:29:11,942 INFO L93 Difference]: Finished difference Result 125991 states and 203105 transitions. [2024-10-14 03:29:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:29:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-14 03:29:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:29:12,139 INFO L225 Difference]: With dead ends: 125991 [2024-10-14 03:29:12,139 INFO L226 Difference]: Without dead ends: 125989 [2024-10-14 03:29:12,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:29:12,181 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 0 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:29:12,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1841 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:29:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125989 states. [2024-10-14 03:29:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125989 to 125988. [2024-10-14 03:29:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125988 states, 125987 states have (on average 1.5965139260399883) internal successors, (201140), 125987 states have internal predecessors, (201140), 0 states have call successors, (0), 0 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:29:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125988 states to 125988 states and 201140 transitions. [2024-10-14 03:29:14,807 INFO L78 Accepts]: Start accepts. Automaton has 125988 states and 201140 transitions. Word has length 137 [2024-10-14 03:29:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:29:14,807 INFO L471 AbstractCegarLoop]: Abstraction has 125988 states and 201140 transitions. [2024-10-14 03:29:14,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:29:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 125988 states and 201140 transitions. [2024-10-14 03:29:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 03:29:14,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:29:14,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:14,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:29:14,811 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:29:14,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:29:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash -786854852, now seen corresponding path program 1 times [2024-10-14 03:29:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:29:14,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988672198] [2024-10-14 03:29:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:29:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:29:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:29:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:29:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:29:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988672198] [2024-10-14 03:29:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988672198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:29:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:29:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:29:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107239976] [2024-10-14 03:29:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:29:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:29:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:29:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:29:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:29:14,907 INFO L87 Difference]: Start difference. First operand 125988 states and 201140 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:29:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:29:17,646 INFO L93 Difference]: Finished difference Result 376945 states and 601399 transitions. [2024-10-14 03:29:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:29:17,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-10-14 03:29:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:29:18,066 INFO L225 Difference]: With dead ends: 376945 [2024-10-14 03:29:18,067 INFO L226 Difference]: Without dead ends: 251015 [2024-10-14 03:29:18,137 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:29:18,137 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 348 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:29:18,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1178 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:29:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251015 states. [2024-10-14 03:29:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251015 to 251013. [2024-10-14 03:29:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251013 states, 251012 states have (on average 1.585991904769493) internal successors, (398103), 251012 states have internal predecessors, (398103), 0 states have call successors, (0), 0 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:29:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251013 states to 251013 states and 398103 transitions. [2024-10-14 03:29:23,392 INFO L78 Accepts]: Start accepts. Automaton has 251013 states and 398103 transitions. Word has length 173 [2024-10-14 03:29:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:29:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 251013 states and 398103 transitions. [2024-10-14 03:29:23,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:29:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 251013 states and 398103 transitions. [2024-10-14 03:29:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 03:29:23,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:29:23,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:29:23,398 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:29:23,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:29:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 436848603, now seen corresponding path program 1 times [2024-10-14 03:29:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:29:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496935687] [2024-10-14 03:29:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:29:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:29:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:29:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 03:29:23,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:29:23,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496935687] [2024-10-14 03:29:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496935687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:29:23,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:29:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:29:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906252384] [2024-10-14 03:29:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:29:23,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:29:23,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:29:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:29:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:29:23,500 INFO L87 Difference]: Start difference. First operand 251013 states and 398103 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:29:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:29:28,736 INFO L93 Difference]: Finished difference Result 751103 states and 1190454 transitions. [2024-10-14 03:29:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:29:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 173 [2024-10-14 03:29:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:29:29,689 INFO L225 Difference]: With dead ends: 751103 [2024-10-14 03:29:29,689 INFO L226 Difference]: Without dead ends: 500152 [2024-10-14 03:29:29,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:29:29,844 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 350 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:29:29,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1182 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:29:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500152 states.