./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.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 f8fd8a7f4bc5b8a783328ea3ccb02a1c89ebaa08f4ab2de173aa0152f6877b7b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:28:41,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:28:41,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:28:41,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:28:41,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:28:41,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:28:41,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:28:41,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:28:41,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:28:41,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:28:41,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:28:41,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:28:41,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:28:41,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:28:41,802 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:28:41,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:28:41,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:28:41,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:28:41,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:28:41,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:28:41,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:28:41,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:28:41,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:28:41,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:28:41,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:28:41,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:28:41,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:28:41,813 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:28:41,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:28:41,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:28:41,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:28:41,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:28:41,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:28:41,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:28:41,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:28:41,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:28:41,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:28:41,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:28:41,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:28:41,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:28:41,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:28:41,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:28:41,818 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 -> f8fd8a7f4bc5b8a783328ea3ccb02a1c89ebaa08f4ab2de173aa0152f6877b7b [2024-10-13 23:28:42,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:28:42,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:28:42,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:28:42,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:28:42,090 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:28:42,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c [2024-10-13 23:28:43,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:28:43,712 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:28:43,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c [2024-10-13 23:28:43,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c55bc546/ba9ffd3fe0bb4f12aa222260cc3dbc2a/FLAGa607dddff [2024-10-13 23:28:44,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c55bc546/ba9ffd3fe0bb4f12aa222260cc3dbc2a [2024-10-13 23:28:44,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:28:44,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:28:44,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:28:44,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:28:44,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:28:44,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44, skipping insertion in model container [2024-10-13 23:28:44,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:28:44,306 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c[6409,6422] [2024-10-13 23:28:44,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:28:44,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:28:44,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c[6409,6422] [2024-10-13 23:28:44,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:28:44,718 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:28:44,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44 WrapperNode [2024-10-13 23:28:44,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:28:44,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:28:44,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:28:44,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:28:44,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,858 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-13 23:28:44,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:28:44,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:28:44,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:28:44,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:28:44,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,923 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:28:44,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:44,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:45,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:45,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:45,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:28:45,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:28:45,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:28:45,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:28:45,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (1/1) ... [2024-10-13 23:28:45,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:28:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:28:45,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:28:45,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:28:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:28:45,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:28:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:28:45,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:28:45,185 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:28:45,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:28:46,821 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 23:28:46,821 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:28:46,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:28:46,882 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:28:46,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:28:46 BoogieIcfgContainer [2024-10-13 23:28:46,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:28:46,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:28:46,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:28:46,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:28:46,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:28:44" (1/3) ... [2024-10-13 23:28:46,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a28184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:28:46, skipping insertion in model container [2024-10-13 23:28:46,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:44" (2/3) ... [2024-10-13 23:28:46,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a28184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:28:46, skipping insertion in model container [2024-10-13 23:28:46,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:28:46" (3/3) ... [2024-10-13 23:28:46,891 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label40.c [2024-10-13 23:28:46,906 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:28:46,907 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:28:46,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:28:46,997 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;@4328d9e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:28:46,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:28:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 23:28:47,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:47,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:47,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2508923, now seen corresponding path program 1 times [2024-10-13 23:28:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063590748] [2024-10-13 23:28:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:47,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:47,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063590748] [2024-10-13 23:28:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063590748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:47,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:47,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710765515] [2024-10-13 23:28:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:47,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:28:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:28:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:28:47,262 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:47,314 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-13 23:28:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:28:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-13 23:28:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:47,332 INFO L225 Difference]: With dead ends: 441 [2024-10-13 23:28:47,332 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 23:28:47,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:28:47,341 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:47,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:28:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 23:28:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 23:28:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-13 23:28:47,399 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 43 [2024-10-13 23:28:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:47,400 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-13 23:28:47,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-13 23:28:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 23:28:47,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:47,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:47,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:28:47,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:47,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1725874053, now seen corresponding path program 1 times [2024-10-13 23:28:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918222686] [2024-10-13 23:28:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:47,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918222686] [2024-10-13 23:28:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918222686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:47,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:47,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324227777] [2024-10-13 23:28:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:47,597 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:48,541 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-13 23:28:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-13 23:28:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:48,548 INFO L225 Difference]: With dead ends: 630 [2024-10-13 23:28:48,548 INFO L226 Difference]: Without dead ends: 412 [2024-10-13 23:28:48,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:48,552 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 180 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:48,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:28:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-13 23:28:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-13 23:28:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-13 23:28:48,581 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 43 [2024-10-13 23:28:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:48,581 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-13 23:28:48,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-13 23:28:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 23:28:48,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:48,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:48,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:28:48,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:48,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1439396477, now seen corresponding path program 1 times [2024-10-13 23:28:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415802236] [2024-10-13 23:28:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:48,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415802236] [2024-10-13 23:28:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415802236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:48,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:48,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264389176] [2024-10-13 23:28:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:48,823 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:49,586 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-13 23:28:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:49,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-13 23:28:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:49,591 INFO L225 Difference]: With dead ends: 1210 [2024-10-13 23:28:49,591 INFO L226 Difference]: Without dead ends: 799 [2024-10-13 23:28:49,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:49,594 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:49,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:28:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-13 23:28:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-13 23:28:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3761118170266835) internal successors, (1083), 787 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1083 transitions. [2024-10-13 23:28:49,627 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1083 transitions. Word has length 111 [2024-10-13 23:28:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:49,627 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1083 transitions. [2024-10-13 23:28:49,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1083 transitions. [2024-10-13 23:28:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 23:28:49,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:49,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:49,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:28:49,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1776100391, now seen corresponding path program 1 times [2024-10-13 23:28:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062584444] [2024-10-13 23:28:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062584444] [2024-10-13 23:28:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062584444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:50,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:50,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:50,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456870908] [2024-10-13 23:28:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:50,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:50,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:50,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:50,002 INFO L87 Difference]: Start difference. First operand 788 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:50,578 INFO L93 Difference]: Finished difference Result 1944 states and 2613 transitions. [2024-10-13 23:28:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-13 23:28:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:50,583 INFO L225 Difference]: With dead ends: 1944 [2024-10-13 23:28:50,583 INFO L226 Difference]: Without dead ends: 1157 [2024-10-13 23:28:50,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:50,586 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:50,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:28:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-13 23:28:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-13 23:28:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.2718614718614718) internal successors, (1469), 1155 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1469 transitions. [2024-10-13 23:28:50,633 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1469 transitions. Word has length 112 [2024-10-13 23:28:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:50,633 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1469 transitions. [2024-10-13 23:28:50,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1469 transitions. [2024-10-13 23:28:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 23:28:50,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:50,639 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:50,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:28:50,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 863227188, now seen corresponding path program 1 times [2024-10-13 23:28:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489175808] [2024-10-13 23:28:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:50,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489175808] [2024-10-13 23:28:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489175808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:50,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243045777] [2024-10-13 23:28:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:28:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:50,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:28:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:28:50,941 INFO L87 Difference]: Start difference. First operand 1156 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:52,208 INFO L93 Difference]: Finished difference Result 3444 states and 4567 transitions. [2024-10-13 23:28:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:28:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-13 23:28:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:52,218 INFO L225 Difference]: With dead ends: 3444 [2024-10-13 23:28:52,218 INFO L226 Difference]: Without dead ends: 2473 [2024-10-13 23:28:52,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:28:52,223 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 350 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:52,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 84 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:28:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-10-13 23:28:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2472. [2024-10-13 23:28:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2471 states have (on average 1.2877377579927154) internal successors, (3182), 2471 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3182 transitions. [2024-10-13 23:28:52,274 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3182 transitions. Word has length 170 [2024-10-13 23:28:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:52,275 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 3182 transitions. [2024-10-13 23:28:52,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3182 transitions. [2024-10-13 23:28:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 23:28:52,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:52,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:52,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:28:52,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1558157383, now seen corresponding path program 1 times [2024-10-13 23:28:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101702218] [2024-10-13 23:28:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101702218] [2024-10-13 23:28:52,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101702218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:52,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:52,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338491216] [2024-10-13 23:28:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:52,549 INFO L87 Difference]: Start difference. First operand 2472 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:53,318 INFO L93 Difference]: Finished difference Result 5694 states and 7519 transitions. [2024-10-13 23:28:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2024-10-13 23:28:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:53,334 INFO L225 Difference]: With dead ends: 5694 [2024-10-13 23:28:53,334 INFO L226 Difference]: Without dead ends: 3591 [2024-10-13 23:28:53,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:53,339 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:53,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 344 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:28:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2024-10-13 23:28:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3578. [2024-10-13 23:28:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3578 states, 3577 states have (on average 1.2524461839530332) internal successors, (4480), 3577 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4480 transitions. [2024-10-13 23:28:53,408 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4480 transitions. Word has length 223 [2024-10-13 23:28:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:53,409 INFO L471 AbstractCegarLoop]: Abstraction has 3578 states and 4480 transitions. [2024-10-13 23:28:53,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4480 transitions. [2024-10-13 23:28:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-13 23:28:53,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:53,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:53,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:28:53,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:53,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash -210989539, now seen corresponding path program 1 times [2024-10-13 23:28:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195785236] [2024-10-13 23:28:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 23:28:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:53,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195785236] [2024-10-13 23:28:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195785236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:53,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138036744] [2024-10-13 23:28:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:53,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:53,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:53,715 INFO L87 Difference]: Start difference. First operand 3578 states and 4480 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:54,439 INFO L93 Difference]: Finished difference Result 7725 states and 9780 transitions. [2024-10-13 23:28:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-10-13 23:28:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:54,455 INFO L225 Difference]: With dead ends: 7725 [2024-10-13 23:28:54,455 INFO L226 Difference]: Without dead ends: 4516 [2024-10-13 23:28:54,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:54,461 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 158 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:54,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 343 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:28:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2024-10-13 23:28:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4498. [2024-10-13 23:28:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 4497 states have (on average 1.2408272181454303) internal successors, (5580), 4497 states have internal predecessors, (5580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 5580 transitions. [2024-10-13 23:28:54,558 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 5580 transitions. Word has length 224 [2024-10-13 23:28:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:54,558 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 5580 transitions. [2024-10-13 23:28:54,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 5580 transitions. [2024-10-13 23:28:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-13 23:28:54,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:54,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:54,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:28:54,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:54,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2068005652, now seen corresponding path program 1 times [2024-10-13 23:28:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719999636] [2024-10-13 23:28:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:54,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 23:28:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719999636] [2024-10-13 23:28:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719999636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657078527] [2024-10-13 23:28:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:54,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:54,823 INFO L87 Difference]: Start difference. First operand 4498 states and 5580 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:55,623 INFO L93 Difference]: Finished difference Result 9740 states and 12304 transitions. [2024-10-13 23:28:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:55,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-10-13 23:28:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:55,690 INFO L225 Difference]: With dead ends: 9740 [2024-10-13 23:28:55,690 INFO L226 Difference]: Without dead ends: 5611 [2024-10-13 23:28:55,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:55,694 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 153 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:55,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 368 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:28:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5611 states. [2024-10-13 23:28:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5611 to 5418. [2024-10-13 23:28:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5418 states, 5417 states have (on average 1.2331548827764445) internal successors, (6680), 5417 states have internal predecessors, (6680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 6680 transitions. [2024-10-13 23:28:55,786 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 6680 transitions. Word has length 225 [2024-10-13 23:28:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:55,786 INFO L471 AbstractCegarLoop]: Abstraction has 5418 states and 6680 transitions. [2024-10-13 23:28:55,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 6680 transitions. [2024-10-13 23:28:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-13 23:28:55,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:55,790 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:55,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:28:55,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:55,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1244190558, now seen corresponding path program 1 times [2024-10-13 23:28:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991978008] [2024-10-13 23:28:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-13 23:28:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991978008] [2024-10-13 23:28:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991978008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:28:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860872833] [2024-10-13 23:28:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:28:56,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:28:56,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:28:56,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:28:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:56,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:28:56,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:28:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-13 23:28:56,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:28:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-13 23:28:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860872833] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 23:28:57,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 23:28:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2024-10-13 23:28:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068907521] [2024-10-13 23:28:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:57,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:28:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:57,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:28:57,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:28:57,750 INFO L87 Difference]: Start difference. First operand 5418 states and 6680 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:59,200 INFO L93 Difference]: Finished difference Result 13051 states and 16453 transitions. [2024-10-13 23:28:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:28:59,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2024-10-13 23:28:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:59,238 INFO L225 Difference]: With dead ends: 13051 [2024-10-13 23:28:59,239 INFO L226 Difference]: Without dead ends: 8928 [2024-10-13 23:28:59,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:28:59,247 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 299 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:59,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 66 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:28:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8928 states. [2024-10-13 23:28:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8928 to 8192. [2024-10-13 23:28:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8192 states, 8191 states have (on average 1.2458796239775363) internal successors, (10205), 8191 states have internal predecessors, (10205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 10205 transitions. [2024-10-13 23:28:59,385 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 10205 transitions. Word has length 245 [2024-10-13 23:28:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:59,385 INFO L471 AbstractCegarLoop]: Abstraction has 8192 states and 10205 transitions. [2024-10-13 23:28:59,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 10205 transitions. [2024-10-13 23:28:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-13 23:28:59,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:59,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:59,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:28:59,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:28:59,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:59,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash 144031095, now seen corresponding path program 1 times [2024-10-13 23:28:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164391448] [2024-10-13 23:28:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-13 23:28:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164391448] [2024-10-13 23:28:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164391448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283566053] [2024-10-13 23:28:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:59,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:59,825 INFO L87 Difference]: Start difference. First operand 8192 states and 10205 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:00,649 INFO L93 Difference]: Finished difference Result 16206 states and 20234 transitions. [2024-10-13 23:29:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:00,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2024-10-13 23:29:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:00,673 INFO L225 Difference]: With dead ends: 16206 [2024-10-13 23:29:00,674 INFO L226 Difference]: Without dead ends: 8199 [2024-10-13 23:29:00,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:00,683 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:00,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 376 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:29:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2024-10-13 23:29:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8191. [2024-10-13 23:29:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8191 states, 8190 states have (on average 1.202075702075702) internal successors, (9845), 8190 states have internal predecessors, (9845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8191 states to 8191 states and 9845 transitions. [2024-10-13 23:29:00,786 INFO L78 Accepts]: Start accepts. Automaton has 8191 states and 9845 transitions. Word has length 252 [2024-10-13 23:29:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:00,786 INFO L471 AbstractCegarLoop]: Abstraction has 8191 states and 9845 transitions. [2024-10-13 23:29:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8191 states and 9845 transitions. [2024-10-13 23:29:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-13 23:29:00,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:00,793 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:00,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:29:00,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 639317807, now seen corresponding path program 1 times [2024-10-13 23:29:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169213888] [2024-10-13 23:29:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 23:29:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169213888] [2024-10-13 23:29:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169213888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:00,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241532558] [2024-10-13 23:29:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:00,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:00,964 INFO L87 Difference]: Start difference. First operand 8191 states and 9845 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:01,682 INFO L93 Difference]: Finished difference Result 18399 states and 22297 transitions. [2024-10-13 23:29:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 292 [2024-10-13 23:29:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:01,703 INFO L225 Difference]: With dead ends: 18399 [2024-10-13 23:29:01,703 INFO L226 Difference]: Without dead ends: 10391 [2024-10-13 23:29:01,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:01,712 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 173 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:01,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 150 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:29:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10391 states. [2024-10-13 23:29:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10391 to 9282. [2024-10-13 23:29:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9282 states, 9281 states have (on average 1.152031031138886) internal successors, (10692), 9281 states have internal predecessors, (10692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9282 states to 9282 states and 10692 transitions. [2024-10-13 23:29:01,831 INFO L78 Accepts]: Start accepts. Automaton has 9282 states and 10692 transitions. Word has length 292 [2024-10-13 23:29:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:01,832 INFO L471 AbstractCegarLoop]: Abstraction has 9282 states and 10692 transitions. [2024-10-13 23:29:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 9282 states and 10692 transitions. [2024-10-13 23:29:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-13 23:29:01,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:01,840 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:01,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:29:01,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:01,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -780333408, now seen corresponding path program 1 times [2024-10-13 23:29:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:01,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023195772] [2024-10-13 23:29:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-13 23:29:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023195772] [2024-10-13 23:29:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023195772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534593452] [2024-10-13 23:29:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:02,165 INFO L87 Difference]: Start difference. First operand 9282 states and 10692 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 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-10-13 23:29:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:02,834 INFO L93 Difference]: Finished difference Result 17269 states and 19956 transitions. [2024-10-13 23:29:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 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 322 [2024-10-13 23:29:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:02,852 INFO L225 Difference]: With dead ends: 17269 [2024-10-13 23:29:02,852 INFO L226 Difference]: Without dead ends: 9280 [2024-10-13 23:29:02,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:02,861 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 148 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:02,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 296 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:29:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9280 states. [2024-10-13 23:29:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9280 to 8728. [2024-10-13 23:29:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8728 states, 8727 states have (on average 1.1359000802108399) internal successors, (9913), 8727 states have internal predecessors, (9913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8728 states to 8728 states and 9913 transitions. [2024-10-13 23:29:02,960 INFO L78 Accepts]: Start accepts. Automaton has 8728 states and 9913 transitions. Word has length 322 [2024-10-13 23:29:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 8728 states and 9913 transitions. [2024-10-13 23:29:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 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-10-13 23:29:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8728 states and 9913 transitions. [2024-10-13 23:29:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-13 23:29:02,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:02,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:02,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:29:02,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2004265898, now seen corresponding path program 1 times [2024-10-13 23:29:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187898251] [2024-10-13 23:29:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:29:03,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187898251] [2024-10-13 23:29:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187898251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548483856] [2024-10-13 23:29:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:03,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:03,367 INFO L87 Difference]: Start difference. First operand 8728 states and 9913 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:04,093 INFO L93 Difference]: Finished difference Result 21135 states and 24079 transitions. [2024-10-13 23:29:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:04,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 341 [2024-10-13 23:29:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:04,111 INFO L225 Difference]: With dead ends: 21135 [2024-10-13 23:29:04,111 INFO L226 Difference]: Without dead ends: 12776 [2024-10-13 23:29:04,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:04,121 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 175 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:04,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 294 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:29:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12776 states. [2024-10-13 23:29:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12776 to 11119. [2024-10-13 23:29:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11119 states, 11118 states have (on average 1.1235833783054505) internal successors, (12492), 11118 states have internal predecessors, (12492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11119 states to 11119 states and 12492 transitions. [2024-10-13 23:29:04,259 INFO L78 Accepts]: Start accepts. Automaton has 11119 states and 12492 transitions. Word has length 341 [2024-10-13 23:29:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:04,260 INFO L471 AbstractCegarLoop]: Abstraction has 11119 states and 12492 transitions. [2024-10-13 23:29:04,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11119 states and 12492 transitions. [2024-10-13 23:29:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-10-13 23:29:04,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:04,279 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:29:04,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1622683421, now seen corresponding path program 1 times [2024-10-13 23:29:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787914267] [2024-10-13 23:29:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-13 23:29:04,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:04,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787914267] [2024-10-13 23:29:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787914267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:04,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883279982] [2024-10-13 23:29:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:04,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:04,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:04,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:04,555 INFO L87 Difference]: Start difference. First operand 11119 states and 12492 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:05,201 INFO L93 Difference]: Finished difference Result 22600 states and 25415 transitions. [2024-10-13 23:29:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:05,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 438 [2024-10-13 23:29:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:05,219 INFO L225 Difference]: With dead ends: 22600 [2024-10-13 23:29:05,220 INFO L226 Difference]: Without dead ends: 12958 [2024-10-13 23:29:05,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:05,231 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 176 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:05,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 137 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:29:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2024-10-13 23:29:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 8346. [2024-10-13 23:29:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8346 states, 8345 states have (on average 1.1284601557819054) internal successors, (9417), 8345 states have internal predecessors, (9417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8346 states to 8346 states and 9417 transitions. [2024-10-13 23:29:05,336 INFO L78 Accepts]: Start accepts. Automaton has 8346 states and 9417 transitions. Word has length 438 [2024-10-13 23:29:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 8346 states and 9417 transitions. [2024-10-13 23:29:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8346 states and 9417 transitions. [2024-10-13 23:29:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-13 23:29:05,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:05,349 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:05,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:29:05,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:05,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:05,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1544914512, now seen corresponding path program 1 times [2024-10-13 23:29:05,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:05,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2903785] [2024-10-13 23:29:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:05,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 23:29:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2903785] [2024-10-13 23:29:05,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2903785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:05,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845294295] [2024-10-13 23:29:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:05,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:05,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:05,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:05,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:05,960 INFO L87 Difference]: Start difference. First operand 8346 states and 9417 transitions. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:06,998 INFO L93 Difference]: Finished difference Result 18533 states and 20892 transitions. [2024-10-13 23:29:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:06,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 448 [2024-10-13 23:29:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:07,013 INFO L225 Difference]: With dead ends: 18533 [2024-10-13 23:29:07,013 INFO L226 Difference]: Without dead ends: 10556 [2024-10-13 23:29:07,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:07,023 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 99 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:07,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 127 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:29:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2024-10-13 23:29:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10186. [2024-10-13 23:29:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10186 states, 10185 states have (on average 1.1175257731958763) internal successors, (11382), 10185 states have internal predecessors, (11382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10186 states to 10186 states and 11382 transitions. [2024-10-13 23:29:07,157 INFO L78 Accepts]: Start accepts. Automaton has 10186 states and 11382 transitions. Word has length 448 [2024-10-13 23:29:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:07,158 INFO L471 AbstractCegarLoop]: Abstraction has 10186 states and 11382 transitions. [2024-10-13 23:29:07,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10186 states and 11382 transitions. [2024-10-13 23:29:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-10-13 23:29:07,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:07,171 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:29:07,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -80736307, now seen corresponding path program 1 times [2024-10-13 23:29:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836122440] [2024-10-13 23:29:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-13 23:29:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836122440] [2024-10-13 23:29:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836122440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115837497] [2024-10-13 23:29:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:07,577 INFO L87 Difference]: Start difference. First operand 10186 states and 11382 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:08,196 INFO L93 Difference]: Finished difference Result 20929 states and 23468 transitions. [2024-10-13 23:29:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:08,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 474 [2024-10-13 23:29:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:08,210 INFO L225 Difference]: With dead ends: 20929 [2024-10-13 23:29:08,211 INFO L226 Difference]: Without dead ends: 11296 [2024-10-13 23:29:08,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:08,220 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:08,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 350 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:29:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-10-13 23:29:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 10743. [2024-10-13 23:29:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10743 states, 10742 states have (on average 1.1145038167938932) internal successors, (11972), 10742 states have internal predecessors, (11972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10743 states to 10743 states and 11972 transitions. [2024-10-13 23:29:08,340 INFO L78 Accepts]: Start accepts. Automaton has 10743 states and 11972 transitions. Word has length 474 [2024-10-13 23:29:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:08,341 INFO L471 AbstractCegarLoop]: Abstraction has 10743 states and 11972 transitions. [2024-10-13 23:29:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 10743 states and 11972 transitions. [2024-10-13 23:29:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-13 23:29:08,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:08,355 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:29:08,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -395974866, now seen corresponding path program 1 times [2024-10-13 23:29:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:08,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811091866] [2024-10-13 23:29:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-10-13 23:29:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811091866] [2024-10-13 23:29:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811091866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:29:09,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754620433] [2024-10-13 23:29:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:29:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:29:09,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:29:09,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:29:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:09,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:29:09,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:29:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-10-13 23:29:09,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:29:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754620433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:29:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:29:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107759414] [2024-10-13 23:29:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:29:09,924 INFO L87 Difference]: Start difference. First operand 10743 states and 11972 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:10,464 INFO L93 Difference]: Finished difference Result 22429 states and 25087 transitions. [2024-10-13 23:29:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 486 [2024-10-13 23:29:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:10,476 INFO L225 Difference]: With dead ends: 22429 [2024-10-13 23:29:10,477 INFO L226 Difference]: Without dead ends: 12239 [2024-10-13 23:29:10,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:29:10,486 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 113 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:10,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 315 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:29:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12239 states. [2024-10-13 23:29:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12239 to 11859. [2024-10-13 23:29:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11859 states, 11858 states have (on average 1.1160398043514927) internal successors, (13234), 11858 states have internal predecessors, (13234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11859 states to 11859 states and 13234 transitions. [2024-10-13 23:29:10,593 INFO L78 Accepts]: Start accepts. Automaton has 11859 states and 13234 transitions. Word has length 486 [2024-10-13 23:29:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:10,593 INFO L471 AbstractCegarLoop]: Abstraction has 11859 states and 13234 transitions. [2024-10-13 23:29:10,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11859 states and 13234 transitions. [2024-10-13 23:29:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-10-13 23:29:10,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:10,609 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:10,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:29:10,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 23:29:10,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:10,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1649979747, now seen corresponding path program 1 times [2024-10-13 23:29:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:10,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686334923] [2024-10-13 23:29:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-13 23:29:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686334923] [2024-10-13 23:29:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686334923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839793908] [2024-10-13 23:29:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:11,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:11,457 INFO L87 Difference]: Start difference. First operand 11859 states and 13234 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:12,024 INFO L93 Difference]: Finished difference Result 25557 states and 28510 transitions. [2024-10-13 23:29:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:12,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 488 [2024-10-13 23:29:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:12,038 INFO L225 Difference]: With dead ends: 25557 [2024-10-13 23:29:12,038 INFO L226 Difference]: Without dead ends: 14067 [2024-10-13 23:29:12,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:12,047 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 106 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:12,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 359 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:29:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14067 states. [2024-10-13 23:29:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14067 to 13511. [2024-10-13 23:29:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 13510 states have (on average 1.1014063656550703) internal successors, (14880), 13510 states have internal predecessors, (14880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 14880 transitions. [2024-10-13 23:29:12,252 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 14880 transitions. Word has length 488 [2024-10-13 23:29:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:12,253 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 14880 transitions. [2024-10-13 23:29:12,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 14880 transitions. [2024-10-13 23:29:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-10-13 23:29:12,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:12,274 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:29:12,275 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1712608941, now seen corresponding path program 1 times [2024-10-13 23:29:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308992731] [2024-10-13 23:29:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 950 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-13 23:29:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:13,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308992731] [2024-10-13 23:29:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308992731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:13,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:29:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304624285] [2024-10-13 23:29:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:13,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:13,075 INFO L87 Difference]: Start difference. First operand 13511 states and 14880 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:14,027 INFO L93 Difference]: Finished difference Result 32018 states and 35409 transitions. [2024-10-13 23:29:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 561 [2024-10-13 23:29:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:14,049 INFO L225 Difference]: With dead ends: 32018 [2024-10-13 23:29:14,049 INFO L226 Difference]: Without dead ends: 19060 [2024-10-13 23:29:14,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:14,061 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 191 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:14,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 159 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:29:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19060 states. [2024-10-13 23:29:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19060 to 17018. [2024-10-13 23:29:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17018 states, 17017 states have (on average 1.096491743550567) internal successors, (18659), 17017 states have internal predecessors, (18659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17018 states to 17018 states and 18659 transitions. [2024-10-13 23:29:14,250 INFO L78 Accepts]: Start accepts. Automaton has 17018 states and 18659 transitions. Word has length 561 [2024-10-13 23:29:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 17018 states and 18659 transitions. [2024-10-13 23:29:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17018 states and 18659 transitions. [2024-10-13 23:29:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-10-13 23:29:14,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:14,263 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:14,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:29:14,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:14,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash -129346086, now seen corresponding path program 1 times [2024-10-13 23:29:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:14,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912273412] [2024-10-13 23:29:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-13 23:29:14,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912273412] [2024-10-13 23:29:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912273412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:14,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457266043] [2024-10-13 23:29:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:14,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:14,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:14,817 INFO L87 Difference]: Start difference. First operand 17018 states and 18659 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:15,792 INFO L93 Difference]: Finished difference Result 35885 states and 39368 transitions. [2024-10-13 23:29:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:15,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 571 [2024-10-13 23:29:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:15,807 INFO L225 Difference]: With dead ends: 35885 [2024-10-13 23:29:15,808 INFO L226 Difference]: Without dead ends: 19236 [2024-10-13 23:29:15,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:15,818 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 181 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:15,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 106 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:29:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19236 states. [2024-10-13 23:29:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19236 to 18858. [2024-10-13 23:29:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18858 states, 18857 states have (on average 1.0925916105425042) internal successors, (20603), 18857 states have internal predecessors, (20603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18858 states to 18858 states and 20603 transitions. [2024-10-13 23:29:16,048 INFO L78 Accepts]: Start accepts. Automaton has 18858 states and 20603 transitions. Word has length 571 [2024-10-13 23:29:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:16,049 INFO L471 AbstractCegarLoop]: Abstraction has 18858 states and 20603 transitions. [2024-10-13 23:29:16,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 18858 states and 20603 transitions. [2024-10-13 23:29:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2024-10-13 23:29:16,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:16,070 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:16,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:29:16,070 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2000406331, now seen corresponding path program 1 times [2024-10-13 23:29:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110390378] [2024-10-13 23:29:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2024-10-13 23:29:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110390378] [2024-10-13 23:29:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110390378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:16,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580005951] [2024-10-13 23:29:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:16,424 INFO L87 Difference]: Start difference. First operand 18858 states and 20603 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:17,003 INFO L93 Difference]: Finished difference Result 38818 states and 42487 transitions. [2024-10-13 23:29:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 659 [2024-10-13 23:29:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:17,021 INFO L225 Difference]: With dead ends: 38818 [2024-10-13 23:29:17,022 INFO L226 Difference]: Without dead ends: 19959 [2024-10-13 23:29:17,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:17,033 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 193 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:17,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 348 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:29:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2024-10-13 23:29:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 19405. [2024-10-13 23:29:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19404 states have (on average 1.0824056895485468) internal successors, (21003), 19404 states have internal predecessors, (21003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 21003 transitions. [2024-10-13 23:29:17,281 INFO L78 Accepts]: Start accepts. Automaton has 19405 states and 21003 transitions. Word has length 659 [2024-10-13 23:29:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:17,282 INFO L471 AbstractCegarLoop]: Abstraction has 19405 states and 21003 transitions. [2024-10-13 23:29:17,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19405 states and 21003 transitions. [2024-10-13 23:29:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2024-10-13 23:29:17,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:17,298 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:17,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:29:17,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:17,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 88315950, now seen corresponding path program 1 times [2024-10-13 23:29:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:17,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481024706] [2024-10-13 23:29:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1651 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-13 23:29:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481024706] [2024-10-13 23:29:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481024706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:18,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:29:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600133738] [2024-10-13 23:29:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:18,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:18,358 INFO L87 Difference]: Start difference. First operand 19405 states and 21003 transitions. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:19,210 INFO L93 Difference]: Finished difference Result 40666 states and 43980 transitions. [2024-10-13 23:29:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:19,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 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 724 [2024-10-13 23:29:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:19,234 INFO L225 Difference]: With dead ends: 40666 [2024-10-13 23:29:19,234 INFO L226 Difference]: Without dead ends: 21630 [2024-10-13 23:29:19,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:19,246 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 176 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:19,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 163 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:29:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21630 states. [2024-10-13 23:29:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21630 to 19405. [2024-10-13 23:29:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19404 states have (on average 1.0824056895485468) internal successors, (21003), 19404 states have internal predecessors, (21003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 21003 transitions. [2024-10-13 23:29:19,507 INFO L78 Accepts]: Start accepts. Automaton has 19405 states and 21003 transitions. Word has length 724 [2024-10-13 23:29:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:19,508 INFO L471 AbstractCegarLoop]: Abstraction has 19405 states and 21003 transitions. [2024-10-13 23:29:19,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 19405 states and 21003 transitions. [2024-10-13 23:29:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2024-10-13 23:29:19,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:19,534 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:19,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 23:29:19,535 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:19,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:19,536 INFO L85 PathProgramCache]: Analyzing trace with hash -474928303, now seen corresponding path program 1 times [2024-10-13 23:29:19,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:19,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950148645] [2024-10-13 23:29:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 999 proven. 8 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2024-10-13 23:29:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950148645] [2024-10-13 23:29:21,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950148645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:29:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109837289] [2024-10-13 23:29:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:21,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:29:21,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:29:21,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:29:21,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:29:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:21,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:29:21,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:29:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2024-10-13 23:29:21,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:29:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109837289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:29:21,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-13 23:29:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362849514] [2024-10-13 23:29:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:21,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:29:21,799 INFO L87 Difference]: Start difference. First operand 19405 states and 21003 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:22,413 INFO L93 Difference]: Finished difference Result 40658 states and 44020 transitions. [2024-10-13 23:29:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 732 [2024-10-13 23:29:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:22,438 INFO L225 Difference]: With dead ends: 40658 [2024-10-13 23:29:22,438 INFO L226 Difference]: Without dead ends: 21622 [2024-10-13 23:29:22,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:29:22,452 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 99 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:22,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 338 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:29:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21622 states. [2024-10-13 23:29:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21622 to 20509. [2024-10-13 23:29:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20509 states, 20508 states have (on average 1.0822118197776478) internal successors, (22194), 20508 states have internal predecessors, (22194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20509 states to 20509 states and 22194 transitions. [2024-10-13 23:29:22,711 INFO L78 Accepts]: Start accepts. Automaton has 20509 states and 22194 transitions. Word has length 732 [2024-10-13 23:29:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 20509 states and 22194 transitions. [2024-10-13 23:29:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 20509 states and 22194 transitions. [2024-10-13 23:29:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-10-13 23:29:22,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:22,728 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:22,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:29:22,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:29:22,929 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:22,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 893586976, now seen corresponding path program 1 times [2024-10-13 23:29:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650222594] [2024-10-13 23:29:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:22,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2389 backedges. 1245 proven. 428 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-10-13 23:29:25,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650222594] [2024-10-13 23:29:25,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650222594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:29:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695544689] [2024-10-13 23:29:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:29:25,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:29:25,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:29:25,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:29:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:25,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:29:26,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:29:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2389 backedges. 1382 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2024-10-13 23:29:26,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:29:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695544689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:29:26,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-10-13 23:29:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848820575] [2024-10-13 23:29:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 23:29:26,467 INFO L87 Difference]: Start difference. First operand 20509 states and 22194 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:27,182 INFO L93 Difference]: Finished difference Result 44147 states and 47733 transitions. [2024-10-13 23:29:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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 862 [2024-10-13 23:29:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:27,207 INFO L225 Difference]: With dead ends: 44147 [2024-10-13 23:29:27,208 INFO L226 Difference]: Without dead ends: 24007 [2024-10-13 23:29:27,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 860 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 23:29:27,221 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 246 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:27,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 132 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:29:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24007 states. [2024-10-13 23:29:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24007 to 20141. [2024-10-13 23:29:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20141 states, 20140 states have (on average 1.081578947368421) internal successors, (21783), 20140 states have internal predecessors, (21783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20141 states to 20141 states and 21783 transitions. [2024-10-13 23:29:27,412 INFO L78 Accepts]: Start accepts. Automaton has 20141 states and 21783 transitions. Word has length 862 [2024-10-13 23:29:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:27,412 INFO L471 AbstractCegarLoop]: Abstraction has 20141 states and 21783 transitions. [2024-10-13 23:29:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 20141 states and 21783 transitions. [2024-10-13 23:29:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2024-10-13 23:29:27,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:27,428 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:27,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 23:29:27,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:29:27,629 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:27,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1911853696, now seen corresponding path program 1 times [2024-10-13 23:29:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157550055] [2024-10-13 23:29:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2399 backedges. 1032 proven. 651 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-10-13 23:29:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157550055] [2024-10-13 23:29:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157550055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:29:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112002415] [2024-10-13 23:29:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:29:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:29:30,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:29:30,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 23:29:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:30,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:29:30,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:29:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2399 backedges. 815 proven. 0 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2024-10-13 23:29:30,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:29:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112002415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:30,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:29:30,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-13 23:29:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550753581] [2024-10-13 23:29:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 23:29:30,800 INFO L87 Difference]: Start difference. First operand 20141 states and 21783 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:31,317 INFO L93 Difference]: Finished difference Result 41206 states and 44535 transitions. [2024-10-13 23:29:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:31,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 872 [2024-10-13 23:29:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:31,334 INFO L225 Difference]: With dead ends: 41206 [2024-10-13 23:29:31,335 INFO L226 Difference]: Without dead ends: 21434 [2024-10-13 23:29:31,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 23:29:31,346 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 98 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:31,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 345 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:29:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2024-10-13 23:29:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 19957. [2024-10-13 23:29:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19957 states, 19956 states have (on average 1.0793245139306473) internal successors, (21539), 19956 states have internal predecessors, (21539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19957 states to 19957 states and 21539 transitions. [2024-10-13 23:29:31,513 INFO L78 Accepts]: Start accepts. Automaton has 19957 states and 21539 transitions. Word has length 872 [2024-10-13 23:29:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:31,514 INFO L471 AbstractCegarLoop]: Abstraction has 19957 states and 21539 transitions. [2024-10-13 23:29:31,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 19957 states and 21539 transitions. [2024-10-13 23:29:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2024-10-13 23:29:31,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:31,532 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:31,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 23:29:31,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 23:29:31,733 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1787097889, now seen corresponding path program 1 times [2024-10-13 23:29:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410356772] [2024-10-13 23:29:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2976 backedges. 1385 proven. 0 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-13 23:29:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410356772] [2024-10-13 23:29:32,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410356772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:32,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:32,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810856076] [2024-10-13 23:29:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:32,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:32,132 INFO L87 Difference]: Start difference. First operand 19957 states and 21539 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:32,647 INFO L93 Difference]: Finished difference Result 38076 states and 41064 transitions. [2024-10-13 23:29:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 933 [2024-10-13 23:29:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:32,649 INFO L225 Difference]: With dead ends: 38076 [2024-10-13 23:29:32,649 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:29:32,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:32,662 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 110 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:32,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 343 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:29:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:29:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:29:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:29:32,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 933 [2024-10-13 23:29:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:32,664 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:29:32,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:29:32,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:29:32,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:29:32,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 23:29:32,670 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-13 23:29:32,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:29:38,239 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 416 DAG size of output: 519 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-13 23:29:40,539 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:29:40,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:29:40 BoogieIcfgContainer [2024-10-13 23:29:40,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:29:40,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:29:40,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:29:40,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:29:40,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:28:46" (3/4) ... [2024-10-13 23:29:40,566 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:29:40,587 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:29:40,588 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:29:40,590 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:29:40,591 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:29:40,744 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:29:40,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:29:40,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:29:40,746 INFO L158 Benchmark]: Toolchain (without parser) took 56740.72ms. Allocated memory was 169.9MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 108.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 794.4MB. Max. memory is 16.1GB. [2024-10-13 23:29:40,746 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:29:40,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.31ms. Allocated memory is still 169.9MB. Free memory was 108.3MB in the beginning and 119.9MB in the end (delta: -11.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-10-13 23:29:40,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.27ms. Allocated memory is still 169.9MB. Free memory was 119.9MB in the beginning and 102.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 23:29:40,748 INFO L158 Benchmark]: Boogie Preprocessor took 173.37ms. Allocated memory is still 169.9MB. Free memory was 102.3MB in the beginning and 77.0MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:29:40,748 INFO L158 Benchmark]: RCFGBuilder took 1847.62ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 77.0MB in the beginning and 80.4MB in the end (delta: -3.4MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-10-13 23:29:40,750 INFO L158 Benchmark]: TraceAbstraction took 53678.97ms. Allocated memory was 209.7MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 79.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-10-13 23:29:40,750 INFO L158 Benchmark]: Witness Printer took 181.45ms. Allocated memory is still 2.8GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 23:29:40,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.31ms. Allocated memory is still 169.9MB. Free memory was 108.3MB in the beginning and 119.9MB in the end (delta: -11.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.27ms. Allocated memory is still 169.9MB. Free memory was 119.9MB in the beginning and 102.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 173.37ms. Allocated memory is still 169.9MB. Free memory was 102.3MB in the beginning and 77.0MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1847.62ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 77.0MB in the beginning and 80.4MB in the end (delta: -3.4MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53678.97ms. Allocated memory was 209.7MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 79.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 181.45ms. Allocated memory is still 2.8GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 148]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 26, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4065 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4065 mSDsluCounter, 6357 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 629 mSDsCounter, 2487 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16385 IncrementalHoareTripleChecker+Invalid, 18872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2487 mSolverCounterUnsat, 5728 mSDtfsCounter, 16385 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3533 GetRequests, 3471 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20509occurred in iteration=23, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 22425 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 14048 NumberOfCodeBlocks, 14048 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 14261 ConstructedInterpolants, 0 QuantifiedInterpolants, 44956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4113 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 32 InterpolantComputations, 26 PerfectInterpolantSequences, 25747/27304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a25 == 9) && (a4 == 1)) && (a23 <= 312)) || (((a25 <= 10) && (a23 <= 138)) && (a4 == 1))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 13) && (a29 <= 220)) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 13) && (a4 == 0)) && (a23 <= 138))) || ((((a25 == 13) && (a29 <= 245)) && (141 <= a29)) && (a4 == 1))) || ((((a25 == 13) && (261 <= a29)) && (a4 == 1)) && (a23 <= 312))) || (((a4 == 0) && (a25 == 11)) && (a23 <= 138))) || (((a25 == 12) && (a4 == 0)) && ((a23 / 25) <= 127750))) || ((((a25 == 12) && (141 <= a29)) && ((a23 / 25) <= 127750)) && (a4 == 1))) || (((a25 == 13) && (a23 <= 138)) && (a4 == 1))) || ((((a25 == 11) && (141 <= a29)) && ((a23 / 25) <= 127750)) && (a4 == 1))) || (((a25 == 12) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 12) && (a4 == 0)) && (((long long) a29 + 554036) <= 0))) || ((((a25 == 13) && (307 <= a23)) && ((a23 / 25) <= 127750)) && (a4 == 1))) || ((((a25 <= 10) && ((a23 / 25) <= 127750)) && (a4 == 1)) && (312 <= a23))) || (((a25 == 12) && (a4 == 0)) && (141 <= a29))) || (((a4 == 0) && (a25 <= 10)) && ((a23 / 25) <= 127750))) || (((a25 == 11) && (278 <= a29)) && (a4 == 1))) || (((((a25 == 12) || (a25 == 11)) && (((long long) 28470 + a29) <= 0)) && ((a23 / 25) <= 127750)) && (a4 == 1))) || ((((307 <= a23) && (a25 <= 10)) && (a4 == 1)) && (a23 <= 312))) || (((a25 <= 10) && (141 <= a29)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:29:40,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE