./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5_overflow.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 1824872e1814c22cdcc3b3649b8009e56b17be6d2a4264ef4e8c02506b8754f7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:21:47,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:21:47,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:21:47,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:21:47,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:21:47,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:21:47,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:21:47,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:21:47,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:21:47,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:21:47,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:21:47,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:21:47,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:21:47,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:21:47,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:21:47,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:21:47,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:21:47,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:21:47,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:21:47,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:21:47,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:21:47,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:21:47,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:21:47,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:21:47,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:21:47,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:21:47,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:21:47,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:21:47,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:21:47,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:21:47,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:21:47,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:21:47,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:21:47,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:21:47,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:21:47,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:21:47,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:21:47,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:21:47,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:21:47,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:21:47,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:21:47,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:21:47,778 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 -> 1824872e1814c22cdcc3b3649b8009e56b17be6d2a4264ef4e8c02506b8754f7 [2024-11-11 21:21:48,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:21:48,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:21:48,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:21:48,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:21:48,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:21:48,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2024-11-11 21:21:49,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:21:49,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:21:49,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2024-11-11 21:21:49,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841064019/683617b1d6524024b275d74b9fa64b6c/FLAGf2433131a [2024-11-11 21:21:49,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841064019/683617b1d6524024b275d74b9fa64b6c [2024-11-11 21:21:49,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:21:49,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:21:49,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:21:49,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:21:49,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:21:49,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:21:49" (1/1) ... [2024-11-11 21:21:49,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf75f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:49, skipping insertion in model container [2024-11-11 21:21:49,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:21:49" (1/1) ... [2024-11-11 21:21:50,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:21:50,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5_overflow.ufo.UNBOUNDED.pals.c[65601,65614] [2024-11-11 21:21:50,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:21:50,535 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:21:50,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5_overflow.ufo.UNBOUNDED.pals.c[65601,65614] [2024-11-11 21:21:50,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:21:50,722 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:21:50,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50 WrapperNode [2024-11-11 21:21:50,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:21:50,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:21:50,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:21:50,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:21:50,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,857 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2132 [2024-11-11 21:21:50,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:21:50,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:21:50,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:21:50,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:21:50,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,931 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:21:50,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:50,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:51,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:51,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:51,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:51,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:21:51,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:21:51,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:21:51,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:21:51,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (1/1) ... [2024-11-11 21:21:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:21:51,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:21:51,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:21:51,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:21:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:21:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:21:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:21:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:21:51,389 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:21:51,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:21:53,621 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2024-11-11 21:21:53,621 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:21:53,663 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:21:53,663 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:21:53,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:21:53 BoogieIcfgContainer [2024-11-11 21:21:53,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:21:53,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:21:53,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:21:53,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:21:53,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:21:49" (1/3) ... [2024-11-11 21:21:53,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b352c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:21:53, skipping insertion in model container [2024-11-11 21:21:53,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:50" (2/3) ... [2024-11-11 21:21:53,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b352c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:21:53, skipping insertion in model container [2024-11-11 21:21:53,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:21:53" (3/3) ... [2024-11-11 21:21:53,677 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2024-11-11 21:21:53,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:21:53,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:21:53,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:21:53,808 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;@b198e1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:21:53,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:21:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.8703170028818443) internal successors, (1298), 695 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:21:53,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:53,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:53,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 46633421, now seen corresponding path program 1 times [2024-11-11 21:21:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10865612] [2024-11-11 21:21:53,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:54,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10865612] [2024-11-11 21:21:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10865612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:54,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:54,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:21:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493725499] [2024-11-11 21:21:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:21:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:21:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:21:54,671 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.8703170028818443) internal successors, (1298), 695 states have internal predecessors, (1298), 0 states have call successors, (0), 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 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:54,741 INFO L93 Difference]: Finished difference Result 838 states and 1557 transitions. [2024-11-11 21:21:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:21:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-11 21:21:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:54,763 INFO L225 Difference]: With dead ends: 838 [2024-11-11 21:21:54,763 INFO L226 Difference]: Without dead ends: 692 [2024-11-11 21:21:54,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:21:54,772 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:54,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-11 21:21:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2024-11-11 21:21:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.8683068017366136) internal successors, (1291), 691 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1291 transitions. [2024-11-11 21:21:54,858 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1291 transitions. Word has length 153 [2024-11-11 21:21:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:54,859 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1291 transitions. [2024-11-11 21:21:54,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1291 transitions. [2024-11-11 21:21:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:21:54,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:54,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:54,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:21:54,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:54,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash -462839669, now seen corresponding path program 1 times [2024-11-11 21:21:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:54,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621100073] [2024-11-11 21:21:54,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:55,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:55,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621100073] [2024-11-11 21:21:55,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621100073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:55,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:55,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:21:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119418900] [2024-11-11 21:21:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:55,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:21:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:21:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:21:55,560 INFO L87 Difference]: Start difference. First operand 692 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:55,716 INFO L93 Difference]: Finished difference Result 837 states and 1550 transitions. [2024-11-11 21:21:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:21:55,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-11 21:21:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:55,728 INFO L225 Difference]: With dead ends: 837 [2024-11-11 21:21:55,728 INFO L226 Difference]: Without dead ends: 692 [2024-11-11 21:21:55,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:21:55,732 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 0 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:55,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5086 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:21:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-11 21:21:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2024-11-11 21:21:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.7742402315484804) internal successors, (1226), 691 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1226 transitions. [2024-11-11 21:21:55,774 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1226 transitions. Word has length 153 [2024-11-11 21:21:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1226 transitions. [2024-11-11 21:21:55,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1226 transitions. [2024-11-11 21:21:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 21:21:55,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:55,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:21:55,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2032916201, now seen corresponding path program 1 times [2024-11-11 21:21:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:55,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647006546] [2024-11-11 21:21:55,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:56,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:56,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647006546] [2024-11-11 21:21:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647006546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:21:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024170649] [2024-11-11 21:21:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:56,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:21:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:21:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:56,186 INFO L87 Difference]: Start difference. First operand 692 states and 1226 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:56,260 INFO L93 Difference]: Finished difference Result 960 states and 1710 transitions. [2024-11-11 21:21:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:21:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 217 [2024-11-11 21:21:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:56,266 INFO L225 Difference]: With dead ends: 960 [2024-11-11 21:21:56,266 INFO L226 Difference]: Without dead ends: 819 [2024-11-11 21:21:56,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:56,268 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 221 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:56,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2382 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:21:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-11 21:21:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2024-11-11 21:21:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.775735294117647) internal successors, (1449), 816 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1449 transitions. [2024-11-11 21:21:56,290 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1449 transitions. Word has length 217 [2024-11-11 21:21:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:56,290 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1449 transitions. [2024-11-11 21:21:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1449 transitions. [2024-11-11 21:21:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 21:21:56,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:56,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:56,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:21:56,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:56,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1022770877, now seen corresponding path program 1 times [2024-11-11 21:21:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234463529] [2024-11-11 21:21:56,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234463529] [2024-11-11 21:21:56,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234463529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:56,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:21:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381407091] [2024-11-11 21:21:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:21:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:56,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:21:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:56,647 INFO L87 Difference]: Start difference. First operand 817 states and 1449 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:56,697 INFO L93 Difference]: Finished difference Result 1325 states and 2361 transitions. [2024-11-11 21:21:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:21:56,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-11 21:21:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:56,704 INFO L225 Difference]: With dead ends: 1325 [2024-11-11 21:21:56,704 INFO L226 Difference]: Without dead ends: 1059 [2024-11-11 21:21:56,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:56,707 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 221 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:56,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2390 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-11 21:21:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1057. [2024-11-11 21:21:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 1.7803030303030303) internal successors, (1880), 1056 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1880 transitions. [2024-11-11 21:21:56,744 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1880 transitions. Word has length 221 [2024-11-11 21:21:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:56,746 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1880 transitions. [2024-11-11 21:21:56,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1880 transitions. [2024-11-11 21:21:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 21:21:56,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:56,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:56,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:21:56,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1113466973, now seen corresponding path program 1 times [2024-11-11 21:21:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192681456] [2024-11-11 21:21:56,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:57,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192681456] [2024-11-11 21:21:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192681456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:21:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705030428] [2024-11-11 21:21:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:21:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:57,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:21:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:57,079 INFO L87 Difference]: Start difference. First operand 1057 states and 1880 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:57,134 INFO L93 Difference]: Finished difference Result 2021 states and 3610 transitions. [2024-11-11 21:21:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:21:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-11-11 21:21:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:57,142 INFO L225 Difference]: With dead ends: 2021 [2024-11-11 21:21:57,142 INFO L226 Difference]: Without dead ends: 1515 [2024-11-11 21:21:57,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:57,146 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 213 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:57,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2391 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-11 21:21:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2024-11-11 21:21:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1512 states have (on average 1.783068783068783) internal successors, (2696), 1512 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2696 transitions. [2024-11-11 21:21:57,197 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2696 transitions. Word has length 225 [2024-11-11 21:21:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:57,198 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2696 transitions. [2024-11-11 21:21:57,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2696 transitions. [2024-11-11 21:21:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-11 21:21:57,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:57,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:57,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:21:57,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1539339209, now seen corresponding path program 1 times [2024-11-11 21:21:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:57,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221289293] [2024-11-11 21:21:57,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221289293] [2024-11-11 21:21:57,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221289293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:57,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:57,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:21:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501399430] [2024-11-11 21:21:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:57,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:21:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:21:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:57,494 INFO L87 Difference]: Start difference. First operand 1513 states and 2696 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:57,574 INFO L93 Difference]: Finished difference Result 3341 states and 5970 transitions. [2024-11-11 21:21:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:21:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2024-11-11 21:21:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:57,585 INFO L225 Difference]: With dead ends: 3341 [2024-11-11 21:21:57,585 INFO L226 Difference]: Without dead ends: 2379 [2024-11-11 21:21:57,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:57,588 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 205 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:57,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 2392 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2024-11-11 21:21:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2024-11-11 21:21:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 2376 states have (on average 1.7828282828282829) internal successors, (4236), 2376 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 4236 transitions. [2024-11-11 21:21:57,669 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 4236 transitions. Word has length 229 [2024-11-11 21:21:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:57,669 INFO L471 AbstractCegarLoop]: Abstraction has 2377 states and 4236 transitions. [2024-11-11 21:21:57,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 4236 transitions. [2024-11-11 21:21:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-11 21:21:57,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:57,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:57,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:21:57,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:57,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1794403537, now seen corresponding path program 1 times [2024-11-11 21:21:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142321337] [2024-11-11 21:21:57,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142321337] [2024-11-11 21:21:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142321337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:21:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316621889] [2024-11-11 21:21:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:21:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:21:57,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:57,951 INFO L87 Difference]: Start difference. First operand 2377 states and 4236 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:58,024 INFO L93 Difference]: Finished difference Result 5837 states and 10414 transitions. [2024-11-11 21:21:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:21:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-11-11 21:21:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:58,041 INFO L225 Difference]: With dead ends: 5837 [2024-11-11 21:21:58,042 INFO L226 Difference]: Without dead ends: 4011 [2024-11-11 21:21:58,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:21:58,049 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 197 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:58,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2393 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2024-11-11 21:21:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 4009. [2024-11-11 21:21:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 4008 states have (on average 1.7794411177644711) internal successors, (7132), 4008 states have internal predecessors, (7132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 7132 transitions. [2024-11-11 21:21:58,162 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 7132 transitions. Word has length 233 [2024-11-11 21:21:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:58,162 INFO L471 AbstractCegarLoop]: Abstraction has 4009 states and 7132 transitions. [2024-11-11 21:21:58,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 7132 transitions. [2024-11-11 21:21:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-11 21:21:58,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:58,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:58,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:21:58,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1913435605, now seen corresponding path program 1 times [2024-11-11 21:21:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83500314] [2024-11-11 21:21:58,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:21:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83500314] [2024-11-11 21:21:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83500314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:58,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:21:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535801413] [2024-11-11 21:21:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:58,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:21:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:21:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:21:58,631 INFO L87 Difference]: Start difference. First operand 4009 states and 7132 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:59,373 INFO L93 Difference]: Finished difference Result 23805 states and 42646 transitions. [2024-11-11 21:21:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:21:59,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2024-11-11 21:21:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:59,465 INFO L225 Difference]: With dead ends: 23805 [2024-11-11 21:21:59,466 INFO L226 Difference]: Without dead ends: 20347 [2024-11-11 21:21:59,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:21:59,483 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 2628 mSDsluCounter, 10211 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 11432 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:59,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2628 Valid, 11432 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:21:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20347 states. [2024-11-11 21:21:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20347 to 7328. [2024-11-11 21:21:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7328 states, 7327 states have (on average 1.7794458850825714) internal successors, (13038), 7327 states have internal predecessors, (13038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 13038 transitions. [2024-11-11 21:21:59,829 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 13038 transitions. Word has length 237 [2024-11-11 21:21:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:59,830 INFO L471 AbstractCegarLoop]: Abstraction has 7328 states and 13038 transitions. [2024-11-11 21:21:59,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:21:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 13038 transitions. [2024-11-11 21:21:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-11 21:21:59,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:59,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:21:59,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:21:59,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:59,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1453341025, now seen corresponding path program 1 times [2024-11-11 21:21:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217578182] [2024-11-11 21:21:59,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217578182] [2024-11-11 21:22:00,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217578182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:00,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:22:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146172919] [2024-11-11 21:22:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:00,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:22:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:00,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:22:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:22:00,152 INFO L87 Difference]: Start difference. First operand 7328 states and 13038 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:00,371 INFO L93 Difference]: Finished difference Result 21287 states and 38031 transitions. [2024-11-11 21:22:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:22:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2024-11-11 21:22:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:00,407 INFO L225 Difference]: With dead ends: 21287 [2024-11-11 21:22:00,407 INFO L226 Difference]: Without dead ends: 14510 [2024-11-11 21:22:00,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:22:00,423 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 736 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 3846 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:00,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 3846 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14510 states. [2024-11-11 21:22:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14510 to 10886. [2024-11-11 21:22:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10886 states, 10885 states have (on average 1.780064308681672) internal successors, (19376), 10885 states have internal predecessors, (19376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10886 states to 10886 states and 19376 transitions. [2024-11-11 21:22:00,915 INFO L78 Accepts]: Start accepts. Automaton has 10886 states and 19376 transitions. Word has length 238 [2024-11-11 21:22:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:00,916 INFO L471 AbstractCegarLoop]: Abstraction has 10886 states and 19376 transitions. [2024-11-11 21:22:00,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10886 states and 19376 transitions. [2024-11-11 21:22:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 21:22:00,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:00,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:00,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:22:00,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1866481297, now seen corresponding path program 1 times [2024-11-11 21:22:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641261620] [2024-11-11 21:22:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641261620] [2024-11-11 21:22:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641261620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:22:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321224946] [2024-11-11 21:22:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:22:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:22:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:01,140 INFO L87 Difference]: Start difference. First operand 10886 states and 19376 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:01,367 INFO L93 Difference]: Finished difference Result 24013 states and 42846 transitions. [2024-11-11 21:22:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:22:01,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-11 21:22:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:01,402 INFO L225 Difference]: With dead ends: 24013 [2024-11-11 21:22:01,403 INFO L226 Difference]: Without dead ends: 16773 [2024-11-11 21:22:01,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:01,420 INFO L435 NwaCegarLoop]: 1427 mSDtfsCounter, 230 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:01,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2615 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16773 states. [2024-11-11 21:22:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16773 to 16771. [2024-11-11 21:22:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16771 states, 16770 states have (on average 1.7762075134168158) internal successors, (29787), 16770 states have internal predecessors, (29787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16771 states to 16771 states and 29787 transitions. [2024-11-11 21:22:01,930 INFO L78 Accepts]: Start accepts. Automaton has 16771 states and 29787 transitions. Word has length 239 [2024-11-11 21:22:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 16771 states and 29787 transitions. [2024-11-11 21:22:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 16771 states and 29787 transitions. [2024-11-11 21:22:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 21:22:01,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:01,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:22:01,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:01,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1951768689, now seen corresponding path program 1 times [2024-11-11 21:22:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868985056] [2024-11-11 21:22:01,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:02,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:02,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868985056] [2024-11-11 21:22:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868985056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:02,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:22:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776283375] [2024-11-11 21:22:02,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:02,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:22:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:02,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:22:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:02,157 INFO L87 Difference]: Start difference. First operand 16771 states and 29787 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:02,566 INFO L93 Difference]: Finished difference Result 32435 states and 57586 transitions. [2024-11-11 21:22:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:22:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-11 21:22:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:02,621 INFO L225 Difference]: With dead ends: 32435 [2024-11-11 21:22:02,622 INFO L226 Difference]: Without dead ends: 23729 [2024-11-11 21:22:02,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:02,645 INFO L435 NwaCegarLoop]: 1416 mSDtfsCounter, 222 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:02,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 2605 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:22:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23729 states. [2024-11-11 21:22:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23729 to 23727. [2024-11-11 21:22:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23727 states, 23726 states have (on average 1.7691561999494225) internal successors, (41975), 23726 states have internal predecessors, (41975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23727 states to 23727 states and 41975 transitions. [2024-11-11 21:22:03,262 INFO L78 Accepts]: Start accepts. Automaton has 23727 states and 41975 transitions. Word has length 239 [2024-11-11 21:22:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 23727 states and 41975 transitions. [2024-11-11 21:22:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23727 states and 41975 transitions. [2024-11-11 21:22:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 21:22:03,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:03,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:03,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:22:03,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:03,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash 844816977, now seen corresponding path program 1 times [2024-11-11 21:22:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:03,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639357149] [2024-11-11 21:22:03,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:03,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-11-11 21:22:03,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639357149] [2024-11-11 21:22:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639357149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:03,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:22:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536727320] [2024-11-11 21:22:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:03,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:22:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:22:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:03,521 INFO L87 Difference]: Start difference. First operand 23727 states and 41975 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:04,104 INFO L93 Difference]: Finished difference Result 45935 states and 81222 transitions. [2024-11-11 21:22:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:22:04,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-11 21:22:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:04,180 INFO L225 Difference]: With dead ends: 45935 [2024-11-11 21:22:04,180 INFO L226 Difference]: Without dead ends: 33517 [2024-11-11 21:22:04,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:04,201 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 214 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:04,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 2586 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33517 states. [2024-11-11 21:22:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33517 to 33515. [2024-11-11 21:22:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33515 states, 33514 states have (on average 1.761263949394283) internal successors, (59027), 33514 states have internal predecessors, (59027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33515 states to 33515 states and 59027 transitions. [2024-11-11 21:22:05,098 INFO L78 Accepts]: Start accepts. Automaton has 33515 states and 59027 transitions. Word has length 239 [2024-11-11 21:22:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:05,099 INFO L471 AbstractCegarLoop]: Abstraction has 33515 states and 59027 transitions. [2024-11-11 21:22:05,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 33515 states and 59027 transitions. [2024-11-11 21:22:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 21:22:05,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:05,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:05,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:22:05,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 120587313, now seen corresponding path program 1 times [2024-11-11 21:22:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623717348] [2024-11-11 21:22:05,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:05,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623717348] [2024-11-11 21:22:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623717348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:05,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:22:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943418045] [2024-11-11 21:22:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:05,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:22:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:22:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:05,321 INFO L87 Difference]: Start difference. First operand 33515 states and 59027 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:06,500 INFO L93 Difference]: Finished difference Result 64899 states and 114226 transitions. [2024-11-11 21:22:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:22:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-11 21:22:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:06,627 INFO L225 Difference]: With dead ends: 64899 [2024-11-11 21:22:06,627 INFO L226 Difference]: Without dead ends: 47233 [2024-11-11 21:22:06,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:06,668 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 206 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:06,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 2567 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:22:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47233 states. [2024-11-11 21:22:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47233 to 47231. [2024-11-11 21:22:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47231 states, 47230 states have (on average 1.7523819606182511) internal successors, (82765), 47230 states have internal predecessors, (82765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47231 states to 47231 states and 82765 transitions. [2024-11-11 21:22:07,728 INFO L78 Accepts]: Start accepts. Automaton has 47231 states and 82765 transitions. Word has length 239 [2024-11-11 21:22:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:07,728 INFO L471 AbstractCegarLoop]: Abstraction has 47231 states and 82765 transitions. [2024-11-11 21:22:07,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47231 states and 82765 transitions. [2024-11-11 21:22:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 21:22:07,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:07,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:07,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:22:07,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:07,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 817169937, now seen corresponding path program 1 times [2024-11-11 21:22:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009945548] [2024-11-11 21:22:07,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:07,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009945548] [2024-11-11 21:22:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009945548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:08,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:08,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:22:08,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631077139] [2024-11-11 21:22:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:08,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:22:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:22:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:08,079 INFO L87 Difference]: Start difference. First operand 47231 states and 82765 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:08,851 INFO L93 Difference]: Finished difference Result 91419 states and 160062 transitions. [2024-11-11 21:22:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:22:08,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-11 21:22:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:09,178 INFO L225 Difference]: With dead ends: 91419 [2024-11-11 21:22:09,179 INFO L226 Difference]: Without dead ends: 66361 [2024-11-11 21:22:09,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:22:09,244 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 198 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:09,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 2548 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:22:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66361 states. [2024-11-11 21:22:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66361 to 66359. [2024-11-11 21:22:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66359 states, 66358 states have (on average 1.7423219506314236) internal successors, (115617), 66358 states have internal predecessors, (115617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66359 states to 66359 states and 115617 transitions. [2024-11-11 21:22:10,877 INFO L78 Accepts]: Start accepts. Automaton has 66359 states and 115617 transitions. Word has length 239 [2024-11-11 21:22:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:10,878 INFO L471 AbstractCegarLoop]: Abstraction has 66359 states and 115617 transitions. [2024-11-11 21:22:10,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 66359 states and 115617 transitions. [2024-11-11 21:22:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 21:22:10,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:10,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:22:10,883 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 93693410, now seen corresponding path program 1 times [2024-11-11 21:22:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772636957] [2024-11-11 21:22:10,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:10,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772636957] [2024-11-11 21:22:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772636957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:22:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898219461] [2024-11-11 21:22:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:11,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:22:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:22:11,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:22:11,222 INFO L87 Difference]: Start difference. First operand 66359 states and 115617 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:12,773 INFO L93 Difference]: Finished difference Result 219525 states and 382555 transitions. [2024-11-11 21:22:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:22:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-11 21:22:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:13,275 INFO L225 Difference]: With dead ends: 219525 [2024-11-11 21:22:13,279 INFO L226 Difference]: Without dead ends: 153767 [2024-11-11 21:22:13,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:22:13,388 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 734 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:13,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3843 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153767 states. [2024-11-11 21:22:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153767 to 109794. [2024-11-11 21:22:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109794 states, 109793 states have (on average 1.734791835545071) internal successors, (190468), 109793 states have internal predecessors, (190468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109794 states to 109794 states and 190468 transitions. [2024-11-11 21:22:16,378 INFO L78 Accepts]: Start accepts. Automaton has 109794 states and 190468 transitions. Word has length 239 [2024-11-11 21:22:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:16,379 INFO L471 AbstractCegarLoop]: Abstraction has 109794 states and 190468 transitions. [2024-11-11 21:22:16,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 109794 states and 190468 transitions. [2024-11-11 21:22:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 21:22:16,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:16,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:16,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:22:16,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 976124982, now seen corresponding path program 1 times [2024-11-11 21:22:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807375202] [2024-11-11 21:22:16,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807375202] [2024-11-11 21:22:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807375202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:16,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:22:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122112348] [2024-11-11 21:22:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:16,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:22:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:22:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:22:16,656 INFO L87 Difference]: Start difference. First operand 109794 states and 190468 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:19,007 INFO L93 Difference]: Finished difference Result 363279 states and 630349 transitions. [2024-11-11 21:22:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:22:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2024-11-11 21:22:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:19,628 INFO L225 Difference]: With dead ends: 363279 [2024-11-11 21:22:19,628 INFO L226 Difference]: Without dead ends: 254086 [2024-11-11 21:22:19,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:22:19,753 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 732 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3841 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254086 states. [2024-11-11 21:22:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254086 to 181497. [2024-11-11 21:22:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181497 states, 181496 states have (on average 1.7272832459117555) internal successors, (313495), 181496 states have internal predecessors, (313495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181497 states to 181497 states and 313495 transitions. [2024-11-11 21:22:24,258 INFO L78 Accepts]: Start accepts. Automaton has 181497 states and 313495 transitions. Word has length 240 [2024-11-11 21:22:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:24,259 INFO L471 AbstractCegarLoop]: Abstraction has 181497 states and 313495 transitions. [2024-11-11 21:22:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 181497 states and 313495 transitions. [2024-11-11 21:22:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-11 21:22:24,261 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:24,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:22:24,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1564263015, now seen corresponding path program 1 times [2024-11-11 21:22:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856803056] [2024-11-11 21:22:24,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:24,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856803056] [2024-11-11 21:22:24,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856803056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:22:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410732379] [2024-11-11 21:22:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:24,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:22:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:24,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:22:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:22:24,584 INFO L87 Difference]: Start difference. First operand 181497 states and 313495 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:28,555 INFO L93 Difference]: Finished difference Result 598865 states and 1034687 transitions. [2024-11-11 21:22:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:22:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-11-11 21:22:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:29,529 INFO L225 Difference]: With dead ends: 598865 [2024-11-11 21:22:29,529 INFO L226 Difference]: Without dead ends: 417969 [2024-11-11 21:22:29,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:22:29,718 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 730 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:29,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3843 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417969 states. [2024-11-11 21:22:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417969 to 299008. [2024-11-11 21:22:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299008 states, 299007 states have (on average 1.719872778898153) internal successors, (514254), 299007 states have internal predecessors, (514254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299008 states to 299008 states and 514254 transitions. [2024-11-11 21:22:38,018 INFO L78 Accepts]: Start accepts. Automaton has 299008 states and 514254 transitions. Word has length 241 [2024-11-11 21:22:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:22:38,019 INFO L471 AbstractCegarLoop]: Abstraction has 299008 states and 514254 transitions. [2024-11-11 21:22:38,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 299008 states and 514254 transitions. [2024-11-11 21:22:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-11 21:22:38,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:22:38,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:22:38,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:22:38,021 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:22:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:22:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1457092045, now seen corresponding path program 1 times [2024-11-11 21:22:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:22:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029367724] [2024-11-11 21:22:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:22:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:22:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:22:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:22:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:22:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029367724] [2024-11-11 21:22:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029367724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:22:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:22:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:22:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562383779] [2024-11-11 21:22:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:22:38,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:22:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:22:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:22:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:22:38,290 INFO L87 Difference]: Start difference. First operand 299008 states and 514254 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:22:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:22:44,988 INFO L93 Difference]: Finished difference Result 979715 states and 1685609 transitions. [2024-11-11 21:22:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:22:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2024-11-11 21:22:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:22:46,584 INFO L225 Difference]: With dead ends: 979715 [2024-11-11 21:22:46,584 INFO L226 Difference]: Without dead ends: 681308 [2024-11-11 21:22:46,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:22:46,885 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 728 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 3845 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:22:46,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 3845 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:22:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681308 states.